/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/loop-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:32:41,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:41,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:41,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:41,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:41,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:41,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:41,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:41,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:41,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:41,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:41,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:41,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:41,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:41,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:41,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:41,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:41,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:41,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:41,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:41,732 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:41,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:41,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:41,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:41,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:41,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:41,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:41,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:41,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:41,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:41,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:41,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:41,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:41,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:41,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:41,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:41,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:41,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:41,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:41,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:41,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:41,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:41,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:32:41,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:41,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:41,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:41,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:41,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:41,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:41,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:41,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:41,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:41,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:41,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:41,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:41,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:41,773 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:41,773 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:41,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:41,773 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:41,773 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-15 12:32:42,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:42,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:42,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:42,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:42,039 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:42,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-15 12:32:42,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c55909b/46df6cdadee04fd6bd4929e9752c9d9b/FLAGdb44e5f4f [2022-04-15 12:32:42,515 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:42,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-15 12:32:42,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c55909b/46df6cdadee04fd6bd4929e9752c9d9b/FLAGdb44e5f4f [2022-04-15 12:32:42,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c55909b/46df6cdadee04fd6bd4929e9752c9d9b [2022-04-15 12:32:42,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:42,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:42,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:42,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:42,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:42,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:42" (1/1) ... [2022-04-15 12:32:42,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d237cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:42, skipping insertion in model container [2022-04-15 12:32:42,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:42" (1/1) ... [2022-04-15 12:32:42,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:42,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:43,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-15 12:32:43,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:43,148 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:43,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-15 12:32:43,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:43,179 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:43,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43 WrapperNode [2022-04-15 12:32:43,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:43,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:43,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:43,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:43,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:43,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:43,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:43,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:43,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (1/1) ... [2022-04-15 12:32:43,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:43,245 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-15 12:32:43,257 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-15 12:32:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:43,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:43,339 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:43,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:43,550 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:43,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:43,556 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 12:32:43,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:43 BoogieIcfgContainer [2022-04-15 12:32:43,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:43,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:43,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:43,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:43,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:42" (1/3) ... [2022-04-15 12:32:43,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c078010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:43, skipping insertion in model container [2022-04-15 12:32:43,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:43" (2/3) ... [2022-04-15 12:32:43,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c078010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:43, skipping insertion in model container [2022-04-15 12:32:43,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:43" (3/3) ... [2022-04-15 12:32:43,565 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.c [2022-04-15 12:32:43,569 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:43,570 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:43,647 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:43,653 INFO L340 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 [2022-04-15 12:32:43,653 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:32:43,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:43,691 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:43,692 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 1 times [2022-04-15 12:32:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:43,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244986180] [2022-04-15 12:32:43,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 2 times [2022-04-15 12:32:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683045814] [2022-04-15 12:32:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:43,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757161946] [2022-04-15 12:32:43,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:43,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:43,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:43,885 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-15 12:32:43,886 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-15 12:32:43,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:32:43,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:43,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:32:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:44,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:44,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-15 12:32:44,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2022-04-15 12:32:44,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:32:44,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-15 12:32:44,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-15 12:32:44,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-15 12:32:44,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2022-04-15 12:32:44,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:44,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:44,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:32:44,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:32:44,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:32:44,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-15 12:32:44,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:44,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2022-04-15 12:32:44,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 12:32:44,688 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-15 12:32:44,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:32:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683045814] [2022-04-15 12:32:44,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:44,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757161946] [2022-04-15 12:32:44,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757161946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:44,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:44,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:32:44,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244986180] [2022-04-15 12:32:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244986180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:44,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:32:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295426153] [2022-04-15 12:32:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:44,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:44,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,736 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-15 12:32:44,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:32:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:32:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:32:44,757 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:45,199 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 12:32:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:32:45,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 12:32:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 12:32:45,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 12:32:45,258 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-15 12:32:45,264 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:32:45,265 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:32:45,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:32:45,270 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:45,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:32:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:32:45,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:45,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,298 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,298 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:45,301 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:32:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:32:45,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:45,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:45,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:32:45,302 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:32:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:45,304 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:32:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:32:45,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:45,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:45,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:45,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:32:45,308 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 12:32:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:45,309 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:32:45,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:32:45,325 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-15 12:32:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:32:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:32:45,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:45,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:45,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 12:32:45,535 WARN L460 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-15 12:32:45,536 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 1 times [2022-04-15 12:32:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:45,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144310739] [2022-04-15 12:32:45,542 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 2 times [2022-04-15 12:32:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:45,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230223062] [2022-04-15 12:32:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:45,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:45,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480243065] [2022-04-15 12:32:45,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:45,570 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-15 12:32:45,579 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-15 12:32:45,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:45,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:45,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:32:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:45,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:46,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-15 12:32:46,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {236#true} is VALID [2022-04-15 12:32:46,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 12:32:46,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-15 12:32:46,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-15 12:32:46,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {236#true} is VALID [2022-04-15 12:32:46,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {259#(<= 1 main_~main__n~0)} is VALID [2022-04-15 12:32:46,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {263#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:46,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:32:46,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:32:46,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:32:46,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:32:46,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:32:46,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} is VALID [2022-04-15 12:32:46,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:46,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-15 12:32:46,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-15 12:32:46,046 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-15 12:32:46,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:46,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-15 12:32:46,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-15 12:32:46,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:46,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {304#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:46,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-15 12:32:46,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {312#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:32:46,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {316#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:32:46,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {320#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:32:46,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {324#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:32:46,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {328#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:32:46,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {236#true} is VALID [2022-04-15 12:32:46,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {236#true} is VALID [2022-04-15 12:32:46,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-15 12:32:46,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-15 12:32:46,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 12:32:46,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {236#true} is VALID [2022-04-15 12:32:46,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-15 12:32:46,442 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-15 12:32:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230223062] [2022-04-15 12:32:46,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480243065] [2022-04-15 12:32:46,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480243065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:46,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:46,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-04-15 12:32:46,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:46,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144310739] [2022-04-15 12:32:46,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144310739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:46,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:46,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:32:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630797118] [2022-04-15 12:32:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:32:46,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:46,449 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), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,464 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-15 12:32:46,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:32:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:32:46,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:32:46,468 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,704 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:32:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:32:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-15 12:32:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-15 12:32:46,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 22 transitions. [2022-04-15 12:32:46,731 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-15 12:32:46,732 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:32:46,732 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:32:46,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:32:46,734 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:46,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:32:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:32:46,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:46,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,753 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,753 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,755 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:32:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:46,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:46,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:46,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:32:46,756 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:32:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,757 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:32:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:46,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:46,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:46,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:46,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 12:32:46,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 12:32:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:46,760 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 12:32:46,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 12:32:46,778 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-15 12:32:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:32:46,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:46,780 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:46,807 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-15 12:32:47,003 WARN L460 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-15 12:32:47,004 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 3 times [2022-04-15 12:32:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:47,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626669721] [2022-04-15 12:32:47,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 4 times [2022-04-15 12:32:47,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:47,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641147427] [2022-04-15 12:32:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:47,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:47,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072060724] [2022-04-15 12:32:47,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:47,029 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-15 12:32:47,031 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-15 12:32:47,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:47,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:47,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:32:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:47,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:47,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-15 12:32:47,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {477#true} is VALID [2022-04-15 12:32:47,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-15 12:32:47,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-15 12:32:47,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-15 12:32:47,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-15 12:32:47,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-15 12:32:47,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {503#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:47,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {507#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:32:47,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {511#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:32:47,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {515#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:32:47,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {519#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-15 12:32:47,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {523#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:32:47,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {523#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {527#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} is VALID [2022-04-15 12:32:47,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {527#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {531#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:32:47,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:47,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-15 12:32:47,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-15 12:32:47,419 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-15 12:32:47,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:48,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-15 12:32:48,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-15 12:32:48,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {548#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:48,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {548#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:48,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:48,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-15 12:32:48,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-15 12:32:48,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-15 12:32:48,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-15 12:32:48,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-15 12:32:48,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {477#true} is VALID [2022-04-15 12:32:48,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-15 12:32:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:32:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641147427] [2022-04-15 12:32:48,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072060724] [2022-04-15 12:32:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072060724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:48,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2022-04-15 12:32:48,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:48,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626669721] [2022-04-15 12:32:48,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626669721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:48,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:32:48,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108556704] [2022-04-15 12:32:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:32:48,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:48,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,612 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-15 12:32:48,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:32:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:32:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:32:48,613 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,848 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:32:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:32:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:32:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-15 12:32:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-15 12:32:48,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2022-04-15 12:32:48,877 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-15 12:32:48,878 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:32:48,878 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:32:48,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:32:48,889 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:48,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:32:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:32:48,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:48,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,909 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,911 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,917 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:32:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:32:48,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:48,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:48,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:32:48,918 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:32:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,922 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:32:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:32:48,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:48,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:48,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:48,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:32:48,924 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 12:32:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:48,924 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:32:48,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:32:48,943 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-15 12:32:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:32:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:32:48,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:48,944 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:48,960 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-15 12:32:49,147 WARN L460 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-15 12:32:49,148 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 5 times [2022-04-15 12:32:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:49,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1630731632] [2022-04-15 12:32:49,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 6 times [2022-04-15 12:32:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:49,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106312877] [2022-04-15 12:32:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:49,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:49,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554488265] [2022-04-15 12:32:49,179 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:49,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:49,187 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-15 12:32:49,189 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-15 12:32:49,230 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:32:49,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:49,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:32:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:49,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:49,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-15 12:32:49,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {725#true} is VALID [2022-04-15 12:32:49,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-15 12:32:49,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-15 12:32:49,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-15 12:32:49,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {725#true} is VALID [2022-04-15 12:32:49,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-15 12:32:49,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {751#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:49,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {755#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:49,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {759#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-15 12:32:49,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {763#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-15 12:32:49,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:49,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:49,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} is VALID [2022-04-15 12:32:49,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:32:49,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} is VALID [2022-04-15 12:32:49,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:49,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-15 12:32:49,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-15 12:32:49,590 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-15 12:32:49,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:50,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-15 12:32:50,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-15 12:32:50,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:50,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {800#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:50,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:50,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-15 12:32:50,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {725#true} is VALID [2022-04-15 12:32:50,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-15 12:32:50,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-15 12:32:50,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-15 12:32:50,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {725#true} is VALID [2022-04-15 12:32:50,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-15 12:32:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:32:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106312877] [2022-04-15 12:32:50,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554488265] [2022-04-15 12:32:50,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554488265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:50,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:50,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2022-04-15 12:32:50,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1630731632] [2022-04-15 12:32:50,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1630731632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:50,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:50,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:32:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238835175] [2022-04-15 12:32:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:32:50,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:50,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:50,873 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-15 12:32:50,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:32:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:50,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:32:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:32:50,874 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:51,138 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:32:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:32:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:32:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-15 12:32:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-15 12:32:51,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-15 12:32:51,164 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-15 12:32:51,165 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:32:51,165 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:32:51,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:32:51,166 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:51,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:32:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:32:51,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:51,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,185 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,185 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:51,186 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:32:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:32:51,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:51,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:51,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:32:51,187 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:32:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:51,188 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:32:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:32:51,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:51,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:51,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:51,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 12:32:51,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 12:32:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:51,190 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 12:32:51,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:51,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 12:32:51,214 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-15 12:32:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:32:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:32:51,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:51,215 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:51,232 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-15 12:32:51,419 WARN L460 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-15 12:32:51,419 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 7 times [2022-04-15 12:32:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44721055] [2022-04-15 12:32:51,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 8 times [2022-04-15 12:32:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:51,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158364995] [2022-04-15 12:32:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:51,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:51,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253791864] [2022-04-15 12:32:51,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:51,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:51,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:51,460 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-15 12:32:51,463 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-15 12:32:51,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:51,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:51,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:32:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:51,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-15 12:32:51,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {986#true} is VALID [2022-04-15 12:32:51,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-15 12:32:51,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-15 12:32:51,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-15 12:32:51,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {986#true} is VALID [2022-04-15 12:32:51,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-15 12:32:51,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1012#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:51,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1012#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1016#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:51,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1020#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:32:51,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {1020#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1024#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:32:51,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1028#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-15 12:32:51,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {1028#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1032#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-15 12:32:51,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1036#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-15 12:32:51,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {1036#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:32:51,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1044#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-15 12:32:51,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {1044#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2022-04-15 12:32:51,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:51,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-15 12:32:51,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-15 12:32:51,903 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-15 12:32:51,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:53,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-15 12:32:53,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-15 12:32:53,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1065#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:53,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1065#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:53,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:53,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-15 12:32:53,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {986#true} is VALID [2022-04-15 12:32:53,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-15 12:32:53,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-15 12:32:53,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-15 12:32:53,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {986#true} is VALID [2022-04-15 12:32:53,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-15 12:32:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:32:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158364995] [2022-04-15 12:32:53,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253791864] [2022-04-15 12:32:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253791864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:53,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:53,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2022-04-15 12:32:53,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44721055] [2022-04-15 12:32:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44721055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:53,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:53,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:32:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020174919] [2022-04-15 12:32:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:32:53,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:53,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,250 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-15 12:32:53,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:32:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:32:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:32:53,252 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,566 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:32:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:32:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:32:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-15 12:32:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-15 12:32:53,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2022-04-15 12:32:53,593 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-15 12:32:53,595 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:32:53,595 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:32:53,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:32:53,596 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:53,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:32:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:32:53,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:53,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,616 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,616 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,617 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:32:53,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:53,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:53,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:32:53,618 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:32:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,619 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:32:53,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:53,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:53,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:53,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 12:32:53,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 12:32:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:53,621 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 12:32:53,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 12:32:53,640 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-15 12:32:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:32:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:32:53,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:53,641 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:53,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 12:32:53,843 WARN L460 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-15 12:32:53,844 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 9 times [2022-04-15 12:32:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:53,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566985526] [2022-04-15 12:32:53,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 10 times [2022-04-15 12:32:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:53,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002307239] [2022-04-15 12:32:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:53,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:53,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681462072] [2022-04-15 12:32:53,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:53,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:53,904 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-15 12:32:53,927 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-15 12:32:53,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:53,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:53,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:32:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:53,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:54,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-15 12:32:54,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1286#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:54,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1290#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:32:54,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1294#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:32:54,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {1294#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1298#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:32:54,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1302#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-15 12:32:54,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {1302#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:32:54,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:32:54,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1314#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-15 12:32:54,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 12))))} is VALID [2022-04-15 12:32:54,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1322#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-15 12:32:54,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {1322#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} is VALID [2022-04-15 12:32:54,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:54,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-15 12:32:54,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 12:32:54,326 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-15 12:32:54,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:55,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 12:32:55,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-15 12:32:55,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:55,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1343#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:55,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:55,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-15 12:32:55,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1260#true} is VALID [2022-04-15 12:32:55,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-15 12:32:55,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-15 12:32:55,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:32:55,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1260#true} is VALID [2022-04-15 12:32:55,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 12:32:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:32:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002307239] [2022-04-15 12:32:55,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681462072] [2022-04-15 12:32:55,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681462072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:55,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:55,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2022-04-15 12:32:55,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:55,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566985526] [2022-04-15 12:32:55,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566985526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:55,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:55,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:32:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752100283] [2022-04-15 12:32:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:32:55,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:55,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:55,922 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-15 12:32:55,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:32:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:55,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:32:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:32:55,923 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:56,217 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:32:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:32:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:32:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-15 12:32:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-15 12:32:56,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2022-04-15 12:32:56,250 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-15 12:32:56,251 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:32:56,251 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:32:56,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:32:56,252 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:56,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:32:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:32:56,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:56,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,274 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,274 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:56,275 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:32:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:56,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:56,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:56,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:32:56,276 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:32:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:56,277 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:32:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:56,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:56,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:56,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:56,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 12:32:56,278 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 12:32:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:56,278 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 12:32:56,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 12:32:56,308 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-15 12:32:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:32:56,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:56,308 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:56,332 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-15 12:32:56,523 WARN L460 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-15 12:32:56,524 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 11 times [2022-04-15 12:32:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2130889072] [2022-04-15 12:32:56,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 12 times [2022-04-15 12:32:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:56,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742157907] [2022-04-15 12:32:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:56,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:56,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018733405] [2022-04-15 12:32:56,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:56,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:56,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:56,544 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-15 12:32:56,557 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-15 12:32:56,610 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:32:56,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:56,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 12:32:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:56,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:56,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-15 12:32:56,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1547#true} is VALID [2022-04-15 12:32:56,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-15 12:32:56,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-15 12:32:56,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-15 12:32:56,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1547#true} is VALID [2022-04-15 12:32:56,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-15 12:32:56,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1573#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:56,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1577#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:32:56,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1577#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1581#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-15 12:32:56,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {1581#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1585#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:32:56,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1589#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-15 12:32:56,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {1589#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1593#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:32:56,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1597#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-15 12:32:56,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1601#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:32:56,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1605#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:32:56,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1609#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-15 12:32:56,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1609#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1613#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:32:56,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {1613#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1617#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2022-04-15 12:32:56,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:56,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-15 12:32:56,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-15 12:32:56,995 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-15 12:32:56,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:58,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-15 12:32:58,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-15 12:32:58,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:58,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1634#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:32:58,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:32:58,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-15 12:32:58,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1547#true} is VALID [2022-04-15 12:32:58,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-15 12:32:58,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-15 12:32:58,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-15 12:32:58,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1547#true} is VALID [2022-04-15 12:32:58,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-15 12:32:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:32:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742157907] [2022-04-15 12:32:58,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:32:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018733405] [2022-04-15 12:32:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018733405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:58,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2022-04-15 12:32:58,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2130889072] [2022-04-15 12:32:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2130889072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:58,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:32:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280622859] [2022-04-15 12:32:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:32:58,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:58,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:58,782 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-15 12:32:58,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:32:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:32:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:32:58,783 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:59,160 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:32:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:32:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:32:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-15 12:32:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-15 12:32:59,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2022-04-15 12:32:59,188 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-15 12:32:59,189 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:32:59,189 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:32:59,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:32:59,190 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:59,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:32:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:32:59,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:59,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,210 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,210 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:59,211 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:32:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:32:59,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:59,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:59,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:32:59,212 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:32:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:59,213 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:32:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:32:59,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:59,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:59,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:59,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:32:59,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 12:32:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:59,215 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:32:59,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:32:59,240 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-15 12:32:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:32:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:32:59,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:59,241 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:59,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:59,451 WARN L460 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-15 12:32:59,452 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 13 times [2022-04-15 12:32:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:59,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383058963] [2022-04-15 12:32:59,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 14 times [2022-04-15 12:32:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873264218] [2022-04-15 12:32:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:59,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:32:59,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444710763] [2022-04-15 12:32:59,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:59,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:59,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:59,473 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:59,507 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-15 12:32:59,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:59,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:59,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 12:32:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:59,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-15 12:32:59,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1847#true} is VALID [2022-04-15 12:32:59,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-15 12:32:59,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-15 12:32:59,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-15 12:32:59,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1847#true} is VALID [2022-04-15 12:32:59,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-15 12:32:59,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1873#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:32:59,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1877#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:32:59,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1881#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} is VALID [2022-04-15 12:32:59,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1881#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1885#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} is VALID [2022-04-15 12:32:59,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:32:59,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-15 12:32:59,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1897#(and (= 6 (+ main_~main__sum~0 (- 15))) (= 7 main_~main__i~0))} is VALID [2022-04-15 12:32:59,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(and (= 6 (+ main_~main__sum~0 (- 15))) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:32:59,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1905#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:32:59,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1905#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1909#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:32:59,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {1909#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1913#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-15 12:32:59,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1913#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1917#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-15 12:32:59,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {1917#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} is VALID [2022-04-15 12:32:59,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:32:59,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-15 12:32:59,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-15 12:32:59,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-15 12:32:59,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:01,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-15 12:33:01,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-15 12:33:01,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1938#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:01,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1938#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:01,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:01,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1847#true} is VALID [2022-04-15 12:33:01,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-15 12:33:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 12:33:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873264218] [2022-04-15 12:33:01,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444710763] [2022-04-15 12:33:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444710763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:01,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:01,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2022-04-15 12:33:01,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:01,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383058963] [2022-04-15 12:33:01,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383058963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:01,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:01,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:33:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147736915] [2022-04-15 12:33:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:01,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:33:01,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:01,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,811 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-15 12:33:01,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:33:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:33:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:33:01,812 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:02,207 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:33:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:33:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:33:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-15 12:33:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-15 12:33:02,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2022-04-15 12:33:02,243 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-15 12:33:02,244 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:33:02,244 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:33:02,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:33:02,245 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:02,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:33:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:33:02,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:02,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,266 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,266 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:02,267 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:33:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:33:02,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:02,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:02,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:33:02,268 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:33:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:02,269 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:33:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:33:02,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:02,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:02,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:02,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 12:33:02,270 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 12:33:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:02,270 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 12:33:02,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:02,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 12:33:02,300 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-15 12:33:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:33:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:33:02,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:02,301 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:02,327 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-15 12:33:02,501 WARN L460 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-15 12:33:02,501 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 15 times [2022-04-15 12:33:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:02,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488790044] [2022-04-15 12:33:02,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 16 times [2022-04-15 12:33:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:02,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318148115] [2022-04-15 12:33:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:02,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:02,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758793508] [2022-04-15 12:33:02,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:02,532 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-15 12:33:02,533 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-15 12:33:02,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:02,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:02,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 12:33:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:02,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-15 12:33:02,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2160#true} is VALID [2022-04-15 12:33:02,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-15 12:33:02,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-15 12:33:02,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-15 12:33:02,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2160#true} is VALID [2022-04-15 12:33:02,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-15 12:33:02,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2186#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:02,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {2186#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2190#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:33:02,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2194#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:33:02,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {2194#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2198#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:33:02,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {2198#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2202#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:33:02,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {2202#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2206#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-15 12:33:02,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {2206#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2210#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-15 12:33:02,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2214#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:33:02,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2218#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-15 12:33:02,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2222#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:33:02,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2222#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2226#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:33:02,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2230#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:33:02,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2234#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:33:02,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} is VALID [2022-04-15 12:33:02,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:02,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-15 12:33:02,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-15 12:33:02,994 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-15 12:33:02,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:04,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-15 12:33:04,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-15 12:33:04,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:04,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2255#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:04,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:04,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-15 12:33:04,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2160#true} is VALID [2022-04-15 12:33:04,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-15 12:33:04,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-15 12:33:04,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-15 12:33:04,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2160#true} is VALID [2022-04-15 12:33:04,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-15 12:33:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:33:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318148115] [2022-04-15 12:33:04,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758793508] [2022-04-15 12:33:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758793508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:04,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:04,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 19 [2022-04-15 12:33:04,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:04,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488790044] [2022-04-15 12:33:04,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488790044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:04,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:04,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:33:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782895462] [2022-04-15 12:33:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:33:04,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:04,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:04,936 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-15 12:33:04,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:33:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:33:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:33:04,937 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:05,376 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:33:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:33:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:33:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-15 12:33:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-15 12:33:05,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2022-04-15 12:33:05,410 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-15 12:33:05,410 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:33:05,410 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:33:05,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:33:05,411 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:05,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:33:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:33:05,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:05,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,434 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,434 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:05,435 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:33:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:33:05,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:05,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:05,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:33:05,436 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:33:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:05,437 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:33:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:33:05,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:05,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:05,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:05,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 12:33:05,438 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 12:33:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:05,438 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 12:33:05,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 12:33:05,467 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-15 12:33:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:33:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:33:05,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:05,468 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:05,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 12:33:05,683 WARN L460 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-15 12:33:05,683 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 17 times [2022-04-15 12:33:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018684928] [2022-04-15 12:33:05,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 18 times [2022-04-15 12:33:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:05,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717828869] [2022-04-15 12:33:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:05,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:05,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016513082] [2022-04-15 12:33:05,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:05,701 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-15 12:33:05,709 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-15 12:33:05,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:33:05,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:05,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-15 12:33:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:06,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-15 12:33:06,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-15 12:33:06,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2512#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:06,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {2512#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2516#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:33:06,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2520#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:33:06,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {2520#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2524#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:33:06,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2528#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-15 12:33:06,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {2528#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:33:06,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2536#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-15 12:33:06,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:33:06,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:06,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2548#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:33:06,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2552#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:33:06,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {2552#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2556#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:06,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {2556#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~0)) 45))} is VALID [2022-04-15 12:33:06,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~0)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:33:06,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2568#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} is VALID [2022-04-15 12:33:06,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {2568#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:06,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-15 12:33:06,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-15 12:33:06,163 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-15 12:33:06,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:08,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-15 12:33:08,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-15 12:33:08,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {2585#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:08,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2585#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:08,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:08,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-15 12:33:08,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-15 12:33:08,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-15 12:33:08,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-15 12:33:08,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-15 12:33:08,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2486#true} is VALID [2022-04-15 12:33:08,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-15 12:33:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 12:33:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:08,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717828869] [2022-04-15 12:33:08,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:08,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016513082] [2022-04-15 12:33:08,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016513082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:08,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:08,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 20 [2022-04-15 12:33:08,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018684928] [2022-04-15 12:33:08,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018684928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:08,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:08,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:33:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669800176] [2022-04-15 12:33:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:08,312 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:33:08,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:08,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,339 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-15 12:33:08,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:33:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:33:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:33:08,340 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:08,876 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:33:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:33:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:33:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-15 12:33:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-15 12:33:08,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2022-04-15 12:33:08,903 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-15 12:33:08,904 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:33:08,904 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:33:08,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:33:08,905 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:08,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:33:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:33:08,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:08,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,931 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,932 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:08,933 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:33:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:33:08,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:08,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:08,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:33:08,934 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:33:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:08,935 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:33:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:33:08,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:08,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:08,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:08,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 12:33:08,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 12:33:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:08,937 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 12:33:08,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:08,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 12:33:08,965 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-15 12:33:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:33:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:33:08,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:08,966 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:08,984 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-15 12:33:09,175 WARN L460 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-15 12:33:09,176 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 19 times [2022-04-15 12:33:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:09,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527394179] [2022-04-15 12:33:09,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 20 times [2022-04-15 12:33:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:09,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946166225] [2022-04-15 12:33:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:09,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:09,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098072868] [2022-04-15 12:33:09,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:09,203 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-15 12:33:09,204 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-15 12:33:09,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:09,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:09,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:33:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:09,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:09,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-15 12:33:09,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2825#true} is VALID [2022-04-15 12:33:09,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-15 12:33:09,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-15 12:33:09,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-15 12:33:09,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2825#true} is VALID [2022-04-15 12:33:09,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-15 12:33:09,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2851#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:09,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {2851#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2855#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:09,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2859#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:33:09,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {2859#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:33:09,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2867#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:33:09,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2871#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-15 12:33:09,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {2871#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2875#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:09,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {2875#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:33:09,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2883#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:09,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2887#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:33:09,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2891#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:09,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2891#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2895#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:09,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {2895#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2899#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:09,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2903#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:09,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2907#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:33:09,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {2907#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 15 main_~main__n~0))} is VALID [2022-04-15 12:33:09,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 15 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:09,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-15 12:33:09,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-15 12:33:09,693 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-15 12:33:09,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:12,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-15 12:33:12,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-15 12:33:12,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {2928#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:12,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2928#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:12,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:12,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-15 12:33:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 12:33:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946166225] [2022-04-15 12:33:12,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098072868] [2022-04-15 12:33:12,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098072868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:12,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:12,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 21 [2022-04-15 12:33:12,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527394179] [2022-04-15 12:33:12,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527394179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:12,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:12,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:33:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244410853] [2022-04-15 12:33:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:33:12,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:12,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,237 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-15 12:33:12,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:33:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:33:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:33:12,238 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,824 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:33:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:33:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:33:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-15 12:33:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-15 12:33:12,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2022-04-15 12:33:12,867 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-15 12:33:12,868 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:33:12,868 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:33:12,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:33:12,869 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:12,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:33:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:33:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:33:12,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:12,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,890 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,891 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,891 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:33:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:33:12,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:33:12,892 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:33:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,892 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:33:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:33:12,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:12,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 12:33:12,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 12:33:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:12,894 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 12:33:12,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 12:33:12,930 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-15 12:33:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:33:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:33:12,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:12,930 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:12,947 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-15 12:33:13,135 WARN L460 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-15 12:33:13,135 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 21 times [2022-04-15 12:33:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:13,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095378905] [2022-04-15 12:33:13,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 22 times [2022-04-15 12:33:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746138155] [2022-04-15 12:33:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:13,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:13,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448609689] [2022-04-15 12:33:13,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:13,155 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-15 12:33:13,159 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-15 12:33:13,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:13,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:13,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 12:33:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:13,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:13,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3177#true} is VALID [2022-04-15 12:33:13,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-15 12:33:13,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3203#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:13,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3207#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:13,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3211#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:33:13,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3215#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:13,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {3215#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:13,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 5 main_~main__i~0))))} is VALID [2022-04-15 12:33:13,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3227#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-15 12:33:13,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3231#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:33:13,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {3231#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3235#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:13,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3239#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:33:13,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3243#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-15 12:33:13,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {3243#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3247#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:33:13,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3251#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-15 12:33:13,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:33:13,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3259#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:33:13,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {3259#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3263#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} is VALID [2022-04-15 12:33:13,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {3263#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2022-04-15 12:33:13,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:13,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-15 12:33:13,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-15 12:33:13,686 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-15 12:33:13,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:16,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-15 12:33:16,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-15 12:33:16,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {3284#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:16,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3284#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:16,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:16,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-15 12:33:16,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3177#true} is VALID [2022-04-15 12:33:16,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-15 12:33:16,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-15 12:33:16,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-15 12:33:16,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3177#true} is VALID [2022-04-15 12:33:16,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-15 12:33:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-15 12:33:16,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:16,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746138155] [2022-04-15 12:33:16,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:16,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448609689] [2022-04-15 12:33:16,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448609689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:16,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:16,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5] total 22 [2022-04-15 12:33:16,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:16,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095378905] [2022-04-15 12:33:16,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095378905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:16,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:16,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:33:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435707542] [2022-04-15 12:33:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:33:16,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:16,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:16,338 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-15 12:33:16,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:33:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:33:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:33:16,339 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:17,061 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:33:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:33:17,061 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:33:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-15 12:33:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-15 12:33:17,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2022-04-15 12:33:17,099 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-15 12:33:17,100 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:33:17,100 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:33:17,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:33:17,101 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:17,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:33:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:33:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:33:17,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:17,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,131 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,131 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:17,133 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:33:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:33:17,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:17,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:17,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:33:17,133 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:33:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:17,134 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:33:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:33:17,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:17,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:17,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:17,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 12:33:17,135 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 12:33:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:17,135 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 12:33:17,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:17,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 12:33:17,188 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-15 12:33:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:33:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:33:17,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:17,188 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:17,215 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-15 12:33:17,389 WARN L460 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-15 12:33:17,389 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 23 times [2022-04-15 12:33:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722149114] [2022-04-15 12:33:17,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 24 times [2022-04-15 12:33:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119974679] [2022-04-15 12:33:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:17,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:17,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387663952] [2022-04-15 12:33:17,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:17,418 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-15 12:33:17,420 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-15 12:33:17,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:33:17,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:17,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-15 12:33:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:17,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:18,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3542#true} is VALID [2022-04-15 12:33:18,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-15 12:33:18,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3568#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:18,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3572#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:33:18,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {3572#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3576#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-15 12:33:18,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {3576#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3580#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:33:18,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3584#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-15 12:33:18,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {3584#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:33:18,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:18,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) main_~main__i~0) 4))} is VALID [2022-04-15 12:33:18,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:18,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-15 12:33:18,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:33:18,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:18,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3616#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-15 12:33:18,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {3616#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3620#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:18,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {3620#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 4) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:18,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 4) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 5 main_~main__i~0))))} is VALID [2022-04-15 12:33:18,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:18,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} is VALID [2022-04-15 12:33:18,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:18,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-15 12:33:18,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-15 12:33:18,022 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-15 12:33:18,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:20,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-15 12:33:20,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-15 12:33:20,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {3653#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:20,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3653#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:20,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:20,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-15 12:33:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-15 12:33:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119974679] [2022-04-15 12:33:20,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387663952] [2022-04-15 12:33:20,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387663952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:20,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:20,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 23 [2022-04-15 12:33:20,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722149114] [2022-04-15 12:33:20,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722149114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:20,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:33:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20903081] [2022-04-15 12:33:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:33:20,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:20,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:20,876 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-15 12:33:20,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:33:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:20,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:33:20,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:33:20,877 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:21,696 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:33:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:33:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:33:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-15 12:33:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-15 12:33:21,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2022-04-15 12:33:21,732 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-15 12:33:21,732 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:33:21,732 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:33:21,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:33:21,733 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:21,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 162 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:33:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:33:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:33:21,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:21,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,765 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,765 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:21,765 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:33:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:33:21,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:21,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:21,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:33:21,766 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:33:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:21,766 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:33:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:33:21,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:21,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:21,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:21,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 12:33:21,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 12:33:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:21,767 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 12:33:21,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:21,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 12:33:21,801 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-15 12:33:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:33:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:33:21,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:21,801 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:21,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 12:33:22,002 WARN L460 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-15 12:33:22,002 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 25 times [2022-04-15 12:33:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519216422] [2022-04-15 12:33:22,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 26 times [2022-04-15 12:33:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880914127] [2022-04-15 12:33:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:22,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:22,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149256311] [2022-04-15 12:33:22,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:22,023 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-15 12:33:22,047 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-15 12:33:22,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:22,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:22,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-15 12:33:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:22,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:22,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-15 12:33:22,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-15 12:33:22,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3946#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:22,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {3946#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3950#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:33:22,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {3950#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3954#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:33:22,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {3954#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-15 12:33:22,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:22,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3966#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-15 12:33:22,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {3966#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3970#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-15 12:33:22,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {3970#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3974#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:33:22,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {3974#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3978#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:22,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {3978#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3982#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:33:22,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {3982#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3986#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:22,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {3986#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3990#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:22,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {3990#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3994#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:22,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {3994#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3998#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:22,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {3998#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4002#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:33:22,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {4002#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-15 12:33:22,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:33:22,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} is VALID [2022-04-15 12:33:22,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 main_~main__n~0))} is VALID [2022-04-15 12:33:22,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:22,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-15 12:33:22,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-15 12:33:22,583 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-15 12:33:22,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:25,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-15 12:33:25,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-15 12:33:25,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {4035#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:25,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4035#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:25,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:25,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-15 12:33:25,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3920#true} is VALID [2022-04-15 12:33:25,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-15 12:33:25,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-15 12:33:25,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-15 12:33:25,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3920#true} is VALID [2022-04-15 12:33:25,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-15 12:33:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-15 12:33:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:25,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880914127] [2022-04-15 12:33:25,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:25,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149256311] [2022-04-15 12:33:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149256311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:25,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:25,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 24 [2022-04-15 12:33:25,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519216422] [2022-04-15 12:33:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519216422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:25,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:25,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:33:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067290471] [2022-04-15 12:33:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:33:25,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:25,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:25,988 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-15 12:33:25,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:33:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:25,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:33:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:33:25,990 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:26,887 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:33:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:33:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:33:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-15 12:33:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-15 12:33:26,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2022-04-15 12:33:26,930 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-15 12:33:26,930 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:33:26,930 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:33:26,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:33:26,931 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:26,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:33:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:33:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:33:26,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:26,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,963 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,963 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:26,963 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:33:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:33:26,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:26,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:26,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:33:26,964 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:33:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:26,965 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:33:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:33:26,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:26,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:26,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:26,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 12:33:26,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 12:33:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:26,966 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 12:33:26,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:26,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 12:33:27,001 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-15 12:33:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:33:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:33:27,002 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:27,002 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:27,018 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-15 12:33:27,203 WARN L460 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-15 12:33:27,203 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 27 times [2022-04-15 12:33:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [781248179] [2022-04-15 12:33:27,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 28 times [2022-04-15 12:33:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142886557] [2022-04-15 12:33:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:27,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636209197] [2022-04-15 12:33:27,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:27,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:27,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:27,222 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-15 12:33:27,231 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-15 12:33:27,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:27,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:27,296 WARN L261 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-15 12:33:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:27,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:27,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4311#true} is VALID [2022-04-15 12:33:27,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-15 12:33:27,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4337#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:27,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4341#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:27,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {4341#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4345#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-15 12:33:27,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4349#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-15 12:33:27,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {4349#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4353#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:27,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {4353#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4357#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-15 12:33:27,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4361#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-15 12:33:27,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4361#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4365#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:33:27,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4369#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:27,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4373#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-15 12:33:27,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {4373#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4377#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:33:27,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:27,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4385#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-15 12:33:27,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {4385#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4389#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:33:27,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {4389#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:27,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4397#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:33:27,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {4397#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4401#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:33:27,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {4401#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4405#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:33:27,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {4405#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-15 12:33:27,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 main_~main__n~0))} is VALID [2022-04-15 12:33:27,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:27,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-15 12:33:27,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-15 12:33:27,870 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-15 12:33:27,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:31,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-15 12:33:31,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-15 12:33:31,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {4430#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:31,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4430#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:31,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:31,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-15 12:33:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-15 12:33:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142886557] [2022-04-15 12:33:31,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636209197] [2022-04-15 12:33:31,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636209197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:31,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:31,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 25 [2022-04-15 12:33:31,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [781248179] [2022-04-15 12:33:31,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [781248179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:31,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:31,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:33:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704272438] [2022-04-15 12:33:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:33:31,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:31,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:31,572 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-15 12:33:31,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:33:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:33:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:33:31,573 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:32,583 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:33:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:33:32,584 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:33:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-15 12:33:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-15 12:33:32,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2022-04-15 12:33:32,629 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-15 12:33:32,629 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:33:32,629 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:33:32,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 19 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:33:32,630 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:32,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:33:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:33:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:33:32,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:32,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,659 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,659 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:32,660 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:33:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:33:32,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:32,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:32,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:33:32,661 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:33:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:32,661 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:33:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:33:32,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:32,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:32,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:32,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 12:33:32,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 12:33:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:32,663 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 12:33:32,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 12:33:32,704 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-15 12:33:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:33:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:33:32,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:32,705 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:32,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 12:33:32,907 WARN L460 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-15 12:33:32,907 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 29 times [2022-04-15 12:33:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:32,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426390155] [2022-04-15 12:33:32,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 30 times [2022-04-15 12:33:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062202425] [2022-04-15 12:33:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:32,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:32,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864762789] [2022-04-15 12:33:32,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:32,946 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-15 12:33:32,972 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-15 12:33:33,011 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 12:33:33,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:33,013 WARN L261 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-15 12:33:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:33,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:33,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4715#true} is VALID [2022-04-15 12:33:33,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4738#(<= 1 main_~main__n~0)} is VALID [2022-04-15 12:33:33,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {4738#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4742#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:33,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {4742#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4746#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:33:33,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4750#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:33:33,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {4750#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4754#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:33:33,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {4754#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 4)) 6))} is VALID [2022-04-15 12:33:33,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 4)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:33:33,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8))))} is VALID [2022-04-15 12:33:33,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} is VALID [2022-04-15 12:33:33,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:33,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:33:33,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} is VALID [2022-04-15 12:33:33,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:33:33,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4790#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-15 12:33:33,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {4790#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:33,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4798#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:33:33,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {4798#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4802#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-15 12:33:33,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {4802#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:33:33,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-15 12:33:33,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-15 12:33:33,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:33:33,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2022-04-15 12:33:33,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:33,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-15 12:33:33,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-15 12:33:33,707 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-15 12:33:33,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:34,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-15 12:33:34,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-15 12:33:34,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {4839#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:34,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4839#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:34,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {4847#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-15 12:33:34,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {4851#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4847#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {4855#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4851#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {4859#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4855#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {4863#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4859#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4863#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4867#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {4875#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4871#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4875#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {4883#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4879#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {4887#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4883#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {4891#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4887#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {4895#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4891#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {4899#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4895#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {4903#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4899#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {4907#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4903#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {4911#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4907#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {4915#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4911#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {4919#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4915#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:33:34,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {4715#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4919#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:33:34,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4715#true} is VALID [2022-04-15 12:33:34,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4715#true} is VALID [2022-04-15 12:33:34,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-15 12:33:34,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-15 12:33:34,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-15 12:33:34,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4715#true} is VALID [2022-04-15 12:33:34,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-15 12:33:34,956 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-15 12:33:34,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:34,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062202425] [2022-04-15 12:33:34,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:34,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864762789] [2022-04-15 12:33:34,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864762789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:34,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:34,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-04-15 12:33:34,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:34,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426390155] [2022-04-15 12:33:34,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426390155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:34,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:34,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:33:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643487371] [2022-04-15 12:33:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:33:34,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:34,958 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), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:35,003 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-15 12:33:35,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:33:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:33:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1557, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:33:35,005 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:36,299 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:33:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:33:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:33:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-15 12:33:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-15 12:33:36,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 36 transitions. [2022-04-15 12:33:36,365 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-15 12:33:36,366 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:33:36,366 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:33:36,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=519, Invalid=1643, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:33:36,367 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:36,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 109 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:33:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:33:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:33:36,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:36,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,413 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,414 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:36,414 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:33:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:33:36,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:36,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:36,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:33:36,415 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:33:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:36,416 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:33:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:33:36,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:36,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:36,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:36,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 12:33:36,419 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 12:33:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:36,419 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 12:33:36,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:36,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 12:33:36,487 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-15 12:33:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:33:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:33:36,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:36,488 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:36,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:33:36,688 WARN L460 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-15 12:33:36,688 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 31 times [2022-04-15 12:33:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:36,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107255316] [2022-04-15 12:33:36,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 32 times [2022-04-15 12:33:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:36,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403996468] [2022-04-15 12:33:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:36,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:36,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615208437] [2022-04-15 12:33:36,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:36,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:36,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:36,706 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-15 12:33:36,717 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-15 12:33:36,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:36,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:36,776 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-15 12:33:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:36,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:37,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-15 12:33:37,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5152#true} is VALID [2022-04-15 12:33:37,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-15 12:33:37,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-15 12:33:37,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-15 12:33:37,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5152#true} is VALID [2022-04-15 12:33:37,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-15 12:33:37,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5178#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:37,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {5178#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5182#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:33:37,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {5182#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5186#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:33:37,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {5186#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 1) main_~main__sum~0 (* (- 1) main_~main__i~0)) 1))} is VALID [2022-04-15 12:33:37,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 1) main_~main__sum~0 (* (- 1) main_~main__i~0)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5194#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:33:37,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:37,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5202#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-15 12:33:37,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {5202#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5206#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:33:37,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {5206#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5210#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:33:37,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {5210#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5214#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-15 12:33:37,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {5214#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5218#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:33:37,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {5218#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5222#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} is VALID [2022-04-15 12:33:37,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {5222#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5226#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:33:37,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {5226#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5230#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-15 12:33:37,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {5230#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5234#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:37,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {5234#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-15 12:33:37,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-15 12:33:37,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 12))} is VALID [2022-04-15 12:33:37,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-15 12:33:37,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5254#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:33:37,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {5254#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:37,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 21 main_~main__n~0))} is VALID [2022-04-15 12:33:37,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 21 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:37,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-15 12:33:37,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-15 12:33:37,364 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-15 12:33:37,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:41,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-15 12:33:41,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-15 12:33:41,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {5279#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:41,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5279#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:41,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:41,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-15 12:33:41,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5152#true} is VALID [2022-04-15 12:33:41,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-15 12:33:41,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-15 12:33:41,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-15 12:33:41,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5152#true} is VALID [2022-04-15 12:33:41,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-15 12:33:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 12:33:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:41,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403996468] [2022-04-15 12:33:41,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:41,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615208437] [2022-04-15 12:33:41,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615208437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:41,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:41,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5] total 27 [2022-04-15 12:33:41,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:41,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107255316] [2022-04-15 12:33:41,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107255316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:41,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:41,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:33:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676602154] [2022-04-15 12:33:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:33:41,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:41,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:41,809 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-15 12:33:41,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:33:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:33:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:33:41,810 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:43,134 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:33:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:33:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:33:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-15 12:33:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-15 12:33:43,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2022-04-15 12:33:43,175 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-15 12:33:43,175 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:33:43,175 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:33:43,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 21 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:33:43,176 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:43,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:33:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:33:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 12:33:43,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:43,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,206 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,206 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:43,207 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:33:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:33:43,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:43,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:43,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:33:43,207 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:33:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:43,208 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:33:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:33:43,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:43,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:43,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:43,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 12:33:43,209 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 12:33:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:43,209 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 12:33:43,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:43,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 12:33:43,265 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-15 12:33:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:33:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:33:43,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:43,265 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:43,283 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-15 12:33:43,467 WARN L460 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-15 12:33:43,468 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 33 times [2022-04-15 12:33:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989134286] [2022-04-15 12:33:43,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 34 times [2022-04-15 12:33:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405130503] [2022-04-15 12:33:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:43,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255172607] [2022-04-15 12:33:43,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:43,486 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-15 12:33:43,495 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-15 12:33:43,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:43,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:43,567 WARN L261 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-15 12:33:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:43,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:44,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5582#true} is VALID [2022-04-15 12:33:44,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-15 12:33:44,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5608#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:44,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {5608#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5612#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:33:44,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {5612#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5616#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:33:44,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {5616#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5620#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-15 12:33:44,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {5620#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5624#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:33:44,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {5624#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:44,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:33:44,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 6))))} is VALID [2022-04-15 12:33:44,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} is VALID [2022-04-15 12:33:44,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5644#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} is VALID [2022-04-15 12:33:44,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {5644#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5648#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-15 12:33:44,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {5648#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5652#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:33:44,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5656#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-15 12:33:44,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {5656#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5660#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:33:44,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {5660#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5664#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:33:44,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {5664#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5668#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:33:44,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {5668#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:33:44,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5676#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:33:44,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {5676#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5680#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-15 12:33:44,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5684#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-15 12:33:44,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {5684#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-15 12:33:44,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5692#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-15 12:33:44,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {5692#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} is VALID [2022-04-15 12:33:44,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:44,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-15 12:33:44,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-15 12:33:44,236 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-15 12:33:44,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:49,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-15 12:33:49,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-15 12:33:49,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:49,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5713#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:49,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:49,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-15 12:33:49,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5582#true} is VALID [2022-04-15 12:33:49,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-15 12:33:49,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-15 12:33:49,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 12:33:49,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5582#true} is VALID [2022-04-15 12:33:49,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-15 12:33:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 12:33:49,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:49,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405130503] [2022-04-15 12:33:49,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:49,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255172607] [2022-04-15 12:33:49,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255172607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:49,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 28 [2022-04-15 12:33:49,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989134286] [2022-04-15 12:33:49,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989134286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:49,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:49,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:33:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855853775] [2022-04-15 12:33:49,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:33:49,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:49,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:49,320 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-15 12:33:49,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:33:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:33:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:33:49,321 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:51,094 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:33:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:33:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:33:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-15 12:33:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-15 12:33:51,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2022-04-15 12:33:51,172 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-15 12:33:51,172 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:33:51,173 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:33:51,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:33:51,173 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:51,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:33:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:33:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:33:51,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:51,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,216 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,216 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:51,216 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:33:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:33:51,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:51,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:51,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:33:51,217 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:33:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:51,217 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:33:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:33:51,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:51,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:51,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:51,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 12:33:51,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 12:33:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:51,219 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 12:33:51,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:51,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 12:33:51,290 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-15 12:33:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:33:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:33:51,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:51,290 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:51,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:51,491 WARN L460 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-15 12:33:51,491 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 35 times [2022-04-15 12:33:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:51,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [647881522] [2022-04-15 12:33:51,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:33:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 36 times [2022-04-15 12:33:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389272497] [2022-04-15 12:33:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:51,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:33:51,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456811591] [2022-04-15 12:33:51,508 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:51,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:51,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:51,509 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-15 12:33:51,532 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-15 12:33:51,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:33:51,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:51,576 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-15 12:33:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:52,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6025#true} is VALID [2022-04-15 12:33:52,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-15 12:33:52,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6051#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:33:52,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {6051#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6055#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:33:52,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {6055#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6059#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:33:52,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {6059#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:33:52,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6067#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:33:52,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6071#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-15 12:33:52,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {6071#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6075#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:52,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6079#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:33:52,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {6079#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:33:52,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-15 12:33:52,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6091#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} is VALID [2022-04-15 12:33:52,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6095#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:52,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6099#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-15 12:33:52,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {6099#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6103#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:33:52,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {6103#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6107#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-15 12:33:52,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {6107#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-15 12:33:52,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) main_~main__sum~0 (* (- 2) main_~main__i~0))))} is VALID [2022-04-15 12:33:52,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) main_~main__sum~0 (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:33:52,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} is VALID [2022-04-15 12:33:52,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 5) main_~main__i~0))))} is VALID [2022-04-15 12:33:52,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} is VALID [2022-04-15 12:33:52,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-15 12:33:52,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* main_~main__i~0 (- 8)))))} is VALID [2022-04-15 12:33:52,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* main_~main__i~0 (- 8)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ main_~main__sum~0 1)))} is VALID [2022-04-15 12:33:52,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ main_~main__sum~0 1)))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:52,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-15 12:33:52,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-15 12:33:52,551 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-15 12:33:52,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:58,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-15 12:33:58,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-15 12:33:58,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {6160#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:33:58,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6160#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:33:58,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:33:58,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-15 12:33:58,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6025#true} is VALID [2022-04-15 12:33:58,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-15 12:33:58,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-15 12:33:58,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-15 12:33:58,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6025#true} is VALID [2022-04-15 12:33:58,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-15 12:33:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-15 12:33:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:58,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389272497] [2022-04-15 12:33:58,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:33:58,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456811591] [2022-04-15 12:33:58,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456811591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:58,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:58,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 5] total 29 [2022-04-15 12:33:58,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:58,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [647881522] [2022-04-15 12:33:58,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [647881522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:58,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:58,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:33:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651592242] [2022-04-15 12:33:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:33:58,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:58,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:58,884 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-15 12:33:58,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:33:58,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:58,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:33:58,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:33:58,885 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:00,936 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:34:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:34:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:34:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-15 12:34:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-15 12:34:00,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2022-04-15 12:34:01,010 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-15 12:34:01,011 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:34:01,011 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:34:01,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:34:01,011 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:01,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:34:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:34:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 12:34:01,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:01,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:01,055 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:01,055 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:01,056 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:34:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:34:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:01,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:34:01,057 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:34:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:01,057 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:34:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:34:01,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:01,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:01,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 12:34:01,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 12:34:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:01,059 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 12:34:01,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:01,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 12:34:01,135 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-15 12:34:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:34:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:34:01,136 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:01,136 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:01,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:34:01,339 WARN L460 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-15 12:34:01,339 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 37 times [2022-04-15 12:34:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:01,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387922391] [2022-04-15 12:34:01,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:34:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 38 times [2022-04-15 12:34:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280579180] [2022-04-15 12:34:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:01,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:01,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:34:01,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704434719] [2022-04-15 12:34:01,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:34:01,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:01,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:01,367 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-15 12:34:01,391 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-15 12:34:01,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:34:01,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:01,429 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-15 12:34:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:01,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:02,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6481#true} is VALID [2022-04-15 12:34:02,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-15 12:34:02,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6507#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:34:02,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {6507#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6511#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:34:02,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {6511#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6515#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:34:02,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {6515#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6519#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-15 12:34:02,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {6519#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6523#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:34:02,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 3 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:34:02,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 3 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 3 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-15 12:34:02,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 3 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6535#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:34:02,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {6535#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6539#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:34:02,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {6539#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6543#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-15 12:34:02,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {6543#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6547#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:34:02,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6551#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-15 12:34:02,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {6551#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6555#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:34:02,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6559#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:34:02,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {6559#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6563#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:34:02,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {6563#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} is VALID [2022-04-15 12:34:02,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6571#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:34:02,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {6571#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6575#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:34:02,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {6575#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-15 12:34:02,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6583#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:34:02,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {6583#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6587#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-15 12:34:02,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {6587#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-15 12:34:02,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-15 12:34:02,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-15 12:34:02,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 24 main_~main__n~0))} is VALID [2022-04-15 12:34:02,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 24 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:02,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-15 12:34:02,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 12:34:02,103 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-15 12:34:02,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:08,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 12:34:08,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-15 12:34:08,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {6620#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:08,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6620#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:34:08,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:08,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6481#true} is VALID [2022-04-15 12:34:08,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 12:34:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-15 12:34:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280579180] [2022-04-15 12:34:08,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:34:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704434719] [2022-04-15 12:34:08,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704434719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:08,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:34:08,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 30 [2022-04-15 12:34:08,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:08,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387922391] [2022-04-15 12:34:08,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387922391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:08,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:08,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:34:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682849071] [2022-04-15 12:34:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:34:08,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:08,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:08,465 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-15 12:34:08,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:34:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:34:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:34:08,466 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:10,651 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:34:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:34:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:34:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-15 12:34:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-15 12:34:10,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2022-04-15 12:34:10,717 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-15 12:34:10,717 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:34:10,717 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:34:10,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:34:10,718 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:10,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:34:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:34:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:34:10,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:10,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,754 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,754 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:10,755 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:34:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:34:10,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:10,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:10,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:34:10,756 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:34:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:10,756 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:34:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:34:10,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:10,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:10,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:10,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 12:34:10,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 12:34:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:10,758 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 12:34:10,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:10,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 12:34:10,847 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-15 12:34:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:34:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:34:10,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:10,848 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:10,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 12:34:11,049 WARN L460 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-15 12:34:11,049 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 39 times [2022-04-15 12:34:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602759901] [2022-04-15 12:34:11,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:34:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 40 times [2022-04-15 12:34:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:11,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127277072] [2022-04-15 12:34:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:11,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:34:11,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993231625] [2022-04-15 12:34:11,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:34:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:11,069 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-15 12:34:11,073 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-15 12:34:11,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:34:11,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:11,138 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-15 12:34:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:11,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:11,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-15 12:34:11,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6950#true} is VALID [2022-04-15 12:34:11,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-15 12:34:11,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-15 12:34:11,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-15 12:34:11,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6950#true} is VALID [2022-04-15 12:34:11,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-15 12:34:11,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6976#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:34:11,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {6976#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6980#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:34:11,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6984#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:11,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {6984#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6988#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:34:11,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {6988#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6992#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} is VALID [2022-04-15 12:34:11,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {6992#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6996#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-15 12:34:11,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {6996#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7000#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-15 12:34:11,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {7000#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:34:11,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {7004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:11,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-15 12:34:11,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:34:11,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) main_~main__sum~0) 28))} is VALID [2022-04-15 12:34:11,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) main_~main__sum~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 1) main_~main__i~0)) 28))} is VALID [2022-04-15 12:34:11,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 1) main_~main__i~0)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7028#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:34:11,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {7028#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7032#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:34:11,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {7032#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7036#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-15 12:34:11,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {7036#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7040#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:34:11,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {7040#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-15 12:34:11,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7048#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-15 12:34:11,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7052#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:34:11,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {7052#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7056#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-15 12:34:11,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {7056#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7060#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} is VALID [2022-04-15 12:34:11,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {7060#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7064#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-15 12:34:11,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {7064#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7068#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} is VALID [2022-04-15 12:34:11,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {7068#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-15 12:34:11,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2022-04-15 12:34:11,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:11,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-15 12:34:11,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-15 12:34:11,875 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-15 12:34:11,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:18,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-15 12:34:18,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-15 12:34:18,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {7093#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:18,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7093#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:34:18,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:18,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6950#true} is VALID [2022-04-15 12:34:18,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-15 12:34:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-15 12:34:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127277072] [2022-04-15 12:34:18,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:34:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993231625] [2022-04-15 12:34:18,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993231625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:18,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:34:18,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5] total 31 [2022-04-15 12:34:18,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602759901] [2022-04-15 12:34:18,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602759901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:18,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:18,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:34:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094468811] [2022-04-15 12:34:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:18,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:34:18,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:18,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:18,961 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-15 12:34:18,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:34:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:34:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:34:18,962 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:21,645 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:34:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:34:21,646 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:34:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-15 12:34:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-15 12:34:21,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2022-04-15 12:34:21,717 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-15 12:34:21,717 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:34:21,717 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:34:21,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:34:21,718 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:21,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:34:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:34:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:34:21,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:21,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,755 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,756 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:21,756 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:34:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:34:21,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:21,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:21,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:34:21,757 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:34:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:21,758 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:34:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:34:21,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:21,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:21,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:21,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 12:34:21,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 12:34:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:21,759 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 12:34:21,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 12:34:21,836 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-15 12:34:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:34:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:34:21,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:21,837 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:21,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 12:34:22,037 WARN L460 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-15 12:34:22,037 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 41 times [2022-04-15 12:34:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425487020] [2022-04-15 12:34:22,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:34:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 42 times [2022-04-15 12:34:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241317773] [2022-04-15 12:34:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:22,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:34:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329857451] [2022-04-15 12:34:22,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:34:22,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:22,058 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-15 12:34:22,071 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-15 12:34:22,136 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 12:34:22,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:22,139 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-15 12:34:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:22,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:22,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7432#true} is VALID [2022-04-15 12:34:22,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-15 12:34:22,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7458#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:34:22,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7462#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:34:22,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {7462#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7466#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:34:22,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {7466#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7470#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-15 12:34:22,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {7470#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7474#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:34:22,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {7474#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7478#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-15 12:34:22,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {7478#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7482#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:22,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7486#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-15 12:34:22,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {7486#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7490#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-15 12:34:22,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {7490#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7494#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:34:22,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {7494#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7498#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:34:22,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7502#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-15 12:34:22,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {7502#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:34:22,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:34:22,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:34:22,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7518#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:34:22,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {7518#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:34:22,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7526#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:34:22,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {7526#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7530#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-15 12:34:22,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {7530#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7534#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} is VALID [2022-04-15 12:34:22,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~0)) 153))} is VALID [2022-04-15 12:34:22,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~0)) 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7542#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-15 12:34:22,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {7542#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7546#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-15 12:34:22,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-15 12:34:22,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7554#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-15 12:34:22,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {7554#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7558#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-15 12:34:22,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 26 main_~main__n~0))} is VALID [2022-04-15 12:34:22,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:22,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-15 12:34:22,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-15 12:34:22,924 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-15 12:34:22,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:30,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-15 12:34:30,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-15 12:34:30,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {7579#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:30,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7579#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:34:30,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:30,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7432#true} is VALID [2022-04-15 12:34:30,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-15 12:34:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:34:30,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241317773] [2022-04-15 12:34:30,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:34:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329857451] [2022-04-15 12:34:30,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329857451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:30,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:34:30,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 32 [2022-04-15 12:34:30,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425487020] [2022-04-15 12:34:30,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425487020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:30,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:30,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:34:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765662361] [2022-04-15 12:34:30,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:34:30,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:30,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:30,669 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-15 12:34:30,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:34:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:34:30,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:34:30,671 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:33,308 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:34:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:34:33,309 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:34:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-15 12:34:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-15 12:34:33,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-04-15 12:34:33,391 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-15 12:34:33,391 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:34:33,391 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:34:33,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:34:33,392 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:33,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:34:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:34:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:34:33,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:33,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,430 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,430 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:33,431 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:34:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:34:33,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:33,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:33,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:34:33,431 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:34:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:33,432 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:34:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:34:33,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:33,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:33,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:33,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 12:34:33,433 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 12:34:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:33,434 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 12:34:33,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:33,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 12:34:33,532 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-15 12:34:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:34:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:34:33,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:33,533 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:33,550 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-15 12:34:33,733 WARN L460 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-15 12:34:33,734 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 43 times [2022-04-15 12:34:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:33,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795062958] [2022-04-15 12:34:33,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:34:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 44 times [2022-04-15 12:34:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614150075] [2022-04-15 12:34:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:33,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:34:33,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647550075] [2022-04-15 12:34:33,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:34:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:33,755 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-15 12:34:33,756 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-15 12:34:33,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:34:33,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:33,808 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-15 12:34:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:33,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:34,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-15 12:34:34,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7953#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:34:34,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {7953#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7957#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:34:34,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {7957#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7961#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:34:34,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {7961#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7965#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-15 12:34:34,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7969#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:34:34,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {7969#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:34:34,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:34:34,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7981#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:34:34,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {7981#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7985#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:34,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {7985#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7989#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-15 12:34:34,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {7989#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:34,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7997#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:34:34,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {7997#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8001#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:34:34,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {8001#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8005#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:34:34,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {8005#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8009#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:34:34,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {8009#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8013#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:34:34,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {8013#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8017#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-15 12:34:34,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {8017#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8021#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-15 12:34:34,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {8021#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8025#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-15 12:34:34,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {8025#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8029#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-15 12:34:34,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {8029#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8033#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-15 12:34:34,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {8033#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8037#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} is VALID [2022-04-15 12:34:34,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {8037#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-15 12:34:34,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= main_~main__i~0 24))} is VALID [2022-04-15 12:34:34,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8049#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-15 12:34:34,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {8049#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8053#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-15 12:34:34,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {8053#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-15 12:34:34,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} is VALID [2022-04-15 12:34:34,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:34,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-15 12:34:34,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-15 12:34:34,574 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-15 12:34:34,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:43,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-15 12:34:43,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-15 12:34:43,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {8078#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:43,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8078#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:34:43,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:43,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-15 12:34:43,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-15 12:34:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-15 12:34:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:43,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614150075] [2022-04-15 12:34:43,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:34:43,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647550075] [2022-04-15 12:34:43,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647550075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:43,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:34:43,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 5] total 33 [2022-04-15 12:34:43,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:43,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795062958] [2022-04-15 12:34:43,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795062958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:43,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:43,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:34:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121819397] [2022-04-15 12:34:43,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:43,314 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:34:43,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:43,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:43,379 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-15 12:34:43,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:34:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:34:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:34:43,380 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:46,370 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:34:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:34:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:34:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-15 12:34:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-15 12:34:46,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2022-04-15 12:34:46,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-15 12:34:46,452 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:34:46,452 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:34:46,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:34:46,452 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:46,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 12:34:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:34:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 12:34:46,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:46,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,494 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,494 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:46,495 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:34:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:34:46,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:46,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:46,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:34:46,495 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:34:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:46,496 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:34:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:34:46,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:46,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:46,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:46,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 12:34:46,497 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 12:34:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:46,497 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 12:34:46,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:46,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 12:34:46,603 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-15 12:34:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:34:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:34:46,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:46,604 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:46,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:34:46,807 WARN L460 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-15 12:34:46,807 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 45 times [2022-04-15 12:34:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898649378] [2022-04-15 12:34:46,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:34:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 46 times [2022-04-15 12:34:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124461135] [2022-04-15 12:34:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:46,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:34:46,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873344026] [2022-04-15 12:34:46,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:34:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:46,825 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-15 12:34:46,826 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-15 12:34:46,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:34:46,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:46,886 WARN L261 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-15 12:34:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:46,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:47,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8435#true} is VALID [2022-04-15 12:34:47,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-15 12:34:47,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8461#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:34:47,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {8461#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8465#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:34:47,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {8465#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-15 12:34:47,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {8469#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:34:47,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8477#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:34:47,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {8477#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8481#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-15 12:34:47,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {8481#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8485#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-15 12:34:47,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {8485#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8489#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:34:47,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8493#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-15 12:34:47,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {8493#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8497#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-15 12:34:47,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {8497#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8501#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:34:47,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {8501#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8505#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-15 12:34:47,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {8505#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:34:47,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 18))))} is VALID [2022-04-15 12:34:47,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 15))))} is VALID [2022-04-15 12:34:47,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 15))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-15 12:34:47,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-15 12:34:47,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-15 12:34:47,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8533#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} is VALID [2022-04-15 12:34:47,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {8533#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8537#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:34:47,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {8537#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:34:47,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8545#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-15 12:34:47,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {8545#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8549#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-15 12:34:47,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-15 12:34:47,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} is VALID [2022-04-15 12:34:47,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8561#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-15 12:34:47,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {8561#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-15 12:34:47,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-15 12:34:47,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= main_~main__i~0 29))} is VALID [2022-04-15 12:34:47,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= main_~main__i~0 29))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:47,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-15 12:34:47,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-15 12:34:47,707 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-15 12:34:47,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:57,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-15 12:34:57,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-15 12:34:57,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {8590#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:34:57,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8590#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:34:57,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:34:57,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8435#true} is VALID [2022-04-15 12:34:57,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-15 12:34:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-04-15 12:34:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:57,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124461135] [2022-04-15 12:34:57,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:34:57,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873344026] [2022-04-15 12:34:57,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873344026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:57,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:34:57,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 5] total 34 [2022-04-15 12:34:57,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:57,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898649378] [2022-04-15 12:34:57,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898649378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:57,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:57,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:34:57,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794489937] [2022-04-15 12:34:57,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:34:57,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:57,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:57,781 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-15 12:34:57,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:34:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:34:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:34:57,782 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:01,778 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:35:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:35:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:35:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-15 12:35:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-15 12:35:01,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-15 12:35:01,868 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-15 12:35:01,869 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:35:01,869 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:35:01,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:35:01,870 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:01,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:35:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:35:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:35:01,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:01,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,911 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,911 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:01,912 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:35:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:35:01,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:01,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:01,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:35:01,913 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:35:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:01,913 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:35:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:35:01,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:01,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:01,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:01,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 12:35:01,914 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 12:35:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:01,915 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 12:35:01,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 12:35:02,012 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-15 12:35:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:35:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:35:02,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:02,012 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:02,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 12:35:02,212 WARN L460 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-15 12:35:02,213 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 47 times [2022-04-15 12:35:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:02,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003080892] [2022-04-15 12:35:02,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:35:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 48 times [2022-04-15 12:35:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:02,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121966396] [2022-04-15 12:35:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:02,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:35:02,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918941627] [2022-04-15 12:35:02,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:35:02,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:02,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:02,232 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-15 12:35:02,261 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-15 12:35:02,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 12:35:02,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:02,310 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-15 12:35:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:02,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:03,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8956#true} is VALID [2022-04-15 12:35:03,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8979#(<= 1 main_~main__n~0)} is VALID [2022-04-15 12:35:03,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {8979#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8983#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:35:03,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {8983#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:35:03,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9011#(and (<= 1 main_~main__n~0) (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:35:03,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {9011#(and (<= 1 main_~main__n~0) (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9015#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:35:03,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {9015#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9019#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-15 12:35:03,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {9019#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9023#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:35:03,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:35:03,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9031#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-15 12:35:03,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:35:03,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:35:03,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 136))} is VALID [2022-04-15 12:35:03,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-15 12:35:03,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-15 12:35:03,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-15 12:35:03,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 19))))} is VALID [2022-04-15 12:35:03,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 19))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-15 12:35:03,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 63) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-15 12:35:03,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~0) (= main_~main__i~0 27))} is VALID [2022-04-15 12:35:03,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~0) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-15 12:35:03,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~0) (= 29 main_~main__i~0))} is VALID [2022-04-15 12:35:03,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~0) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 29 main_~main__n~0))} is VALID [2022-04-15 12:35:03,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:03,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-15 12:35:03,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-15 12:35:03,328 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-15 12:35:03,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:05,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-15 12:35:05,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-15 12:35:05,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:05,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9116#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:35:05,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {9124#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-15 12:35:05,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {9128#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9124#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {9132#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9128#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {9136#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9132#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {9140#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9136#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {9144#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9140#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {9148#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9144#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {9152#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9148#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {9156#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9152#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {9160#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9156#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {9164#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9160#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {9168#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9164#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {9172#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9168#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {9176#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9172#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {9180#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9176#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {9184#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9180#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {9188#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9184#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {9192#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9188#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {9196#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9192#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {9200#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9196#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {9204#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9200#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {9208#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9204#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {9212#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9208#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {9216#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9212#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} is VALID [2022-04-15 12:35:05,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {9220#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9216#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {9224#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9220#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-15 12:35:05,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {9228#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9224#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {9232#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9228#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {8956#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9232#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-15 12:35:05,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8956#true} is VALID [2022-04-15 12:35:05,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8956#true} is VALID [2022-04-15 12:35:05,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-15 12:35:05,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-15 12:35:05,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-15 12:35:05,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8956#true} is VALID [2022-04-15 12:35:05,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-15 12:35:05,813 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-15 12:35:05,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:05,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121966396] [2022-04-15 12:35:05,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:35:05,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918941627] [2022-04-15 12:35:05,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918941627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:05,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:35:05,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2022-04-15 12:35:05,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003080892] [2022-04-15 12:35:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003080892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:05,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:05,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:35:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301423638] [2022-04-15 12:35:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:35:05,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:05,815 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), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:05,919 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-15 12:35:05,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:35:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:35:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=3033, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:35:05,920 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:11,332 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:35:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:35:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:35:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 12:35:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 12:35:11,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-15 12:35:11,427 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-15 12:35:11,428 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:35:11,428 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:35:11,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1005, Invalid=3155, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 12:35:11,429 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:11,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 217 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 12:35:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:35:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 12:35:11,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:11,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,471 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,471 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:11,472 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:35:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:35:11,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:11,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:11,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:35:11,472 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:35:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:11,473 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:35:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:35:11,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:11,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:11,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:11,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 12:35:11,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 12:35:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:11,474 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 12:35:11,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:11,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 12:35:11,582 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-15 12:35:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:35:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:35:11,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:11,583 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:11,599 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-15 12:35:11,783 WARN L460 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-15 12:35:11,783 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 49 times [2022-04-15 12:35:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66668767] [2022-04-15 12:35:11,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:35:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 50 times [2022-04-15 12:35:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56088727] [2022-04-15 12:35:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:11,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:35:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56362833] [2022-04-15 12:35:11,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:35:11,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:11,802 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-15 12:35:11,806 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-15 12:35:11,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:35:11,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:11,857 WARN L261 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-15 12:35:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:11,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:12,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9519#true} is VALID [2022-04-15 12:35:12,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-15 12:35:12,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9545#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:35:12,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {9545#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9549#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:35:12,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {9549#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9553#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:35:12,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {9553#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9557#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:35:12,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {9557#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9561#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-15 12:35:12,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {9561#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9565#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-15 12:35:12,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {9565#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:35:12,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9573#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:35:12,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {9573#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:35:12,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) main_~main__sum~0))} is VALID [2022-04-15 12:35:12,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-15 12:35:12,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:35:12,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-15 12:35:12,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9597#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:35:12,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {9597#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:35:12,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9605#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:35:12,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {9605#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-15 12:35:12,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-15 12:35:12,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} is VALID [2022-04-15 12:35:12,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} is VALID [2022-04-15 12:35:12,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9625#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-15 12:35:12,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {9625#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9629#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-15 12:35:12,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {9629#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9633#(and (= 21 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} is VALID [2022-04-15 12:35:12,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#(and (= 21 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-15 12:35:12,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9641#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-15 12:35:12,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {9641#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9645#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-15 12:35:12,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {9645#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-15 12:35:12,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9653#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-15 12:35:12,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {9653#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-15 12:35:12,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-15 12:35:12,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9665#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} is VALID [2022-04-15 12:35:12,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {9665#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:12,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-15 12:35:12,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-15 12:35:12,766 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-15 12:35:12,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:24,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-15 12:35:24,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-15 12:35:24,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {9682#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:24,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9682#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:35:24,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:24,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:25,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-15 12:35:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-15 12:35:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:25,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56088727] [2022-04-15 12:35:25,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:35:25,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56362833] [2022-04-15 12:35:25,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56362833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:25,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:35:25,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5] total 36 [2022-04-15 12:35:25,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:25,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66668767] [2022-04-15 12:35:25,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66668767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:25,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:25,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:35:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533032776] [2022-04-15 12:35:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:35:25,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:25,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:25,136 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-15 12:35:25,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:35:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:35:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:35:25,137 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,720 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:35:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:35:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:35:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 12:35:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 12:35:30,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-15 12:35:30,801 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-15 12:35:30,802 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:35:30,802 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:35:30,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:35:30,803 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:30,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 266 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 12:35:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:35:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:35:30,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:30,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,848 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,848 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,849 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:35:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:35:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:30,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:30,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:35:30,849 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:35:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,849 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:35:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:35:30,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:30,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:30,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:30,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 12:35:30,850 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 12:35:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:30,851 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 12:35:30,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:30,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 12:35:30,963 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-15 12:35:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:35:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:35:30,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:30,964 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:30,981 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-15 12:35:31,167 WARN L460 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-15 12:35:31,168 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 51 times [2022-04-15 12:35:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:31,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486215202] [2022-04-15 12:35:31,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:35:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 52 times [2022-04-15 12:35:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:31,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196232809] [2022-04-15 12:35:31,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:31,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:31,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:35:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474335895] [2022-04-15 12:35:31,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:35:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:31,193 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-15 12:35:31,195 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-15 12:35:31,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:35:31,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:31,262 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-15 12:35:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:32,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-15 12:35:32,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10066#true} is VALID [2022-04-15 12:35:32,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-15 12:35:32,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-15 12:35:32,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-15 12:35:32,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10066#true} is VALID [2022-04-15 12:35:32,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-15 12:35:32,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:35:32,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {10092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10096#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:35:32,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {10096#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:35:32,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {10100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:35:32,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {10104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10108#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-15 12:35:32,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {10108#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10112#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-15 12:35:32,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {10112#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10116#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-15 12:35:32,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {10116#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10120#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:35:32,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {10120#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10124#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:35:32,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10128#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-15 12:35:32,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {10128#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10132#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:35:32,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {10132#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10136#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:35:32,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {10136#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10140#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-15 12:35:32,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {10140#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10144#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:35:32,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {10144#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:35:32,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:35:32,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10156#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} is VALID [2022-04-15 12:35:32,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {10156#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10160#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} is VALID [2022-04-15 12:35:32,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {10160#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-15 12:35:32,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10168#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:35:32,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {10168#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-15 12:35:32,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} is VALID [2022-04-15 12:35:32,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:35:32,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} is VALID [2022-04-15 12:35:32,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-15 12:35:32,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10192#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-15 12:35:32,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {10192#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-15 12:35:32,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10200#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-15 12:35:32,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {10200#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10204#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-15 12:35:32,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {10204#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10208#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-15 12:35:32,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {10208#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10212#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} is VALID [2022-04-15 12:35:32,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {10212#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:35:32,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 main_~main__i~0) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:32,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-15 12:35:32,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-15 12:35:32,237 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-15 12:35:32,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:51,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-15 12:35:51,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-15 12:35:51,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {10233#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:35:51,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10233#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:35:51,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:35:51,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-15 12:35:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-15 12:35:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196232809] [2022-04-15 12:35:51,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:35:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474335895] [2022-04-15 12:35:51,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474335895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:51,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:35:51,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 5] total 37 [2022-04-15 12:35:51,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486215202] [2022-04-15 12:35:51,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486215202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:51,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:51,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:35:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203472563] [2022-04-15 12:35:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:35:51,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:51,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:51,943 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-15 12:35:51,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:35:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:35:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:35:51,944 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:03,924 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:36:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:36:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:36:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:36:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 12:36:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 12:36:03,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-15 12:36:04,084 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-15 12:36:04,085 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:36:04,085 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:36:04,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:36:04,086 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:36:04,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 12:36:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:36:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:36:04,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:36:04,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:04,146 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:04,146 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:04,147 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:36:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:36:04,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:04,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:04,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:36:04,148 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:36:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:04,148 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:36:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:36:04,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:04,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:04,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:36:04,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:36:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 12:36:04,150 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 12:36:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:36:04,150 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 12:36:04,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:04,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 12:36:04,429 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-15 12:36:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:36:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:36:04,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:36:04,429 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:36:04,454 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-15 12:36:04,630 WARN L460 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-15 12:36:04,630 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:36:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:36:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 53 times [2022-04-15 12:36:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:36:04,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774085437] [2022-04-15 12:36:04,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:36:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 54 times [2022-04-15 12:36:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:36:04,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460124342] [2022-04-15 12:36:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:36:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:36:04,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:36:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115200386] [2022-04-15 12:36:04,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:36:04,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:36:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:36:04,651 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-15 12:36:04,653 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-15 12:36:04,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 12:36:04,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:36:04,732 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-15 12:36:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:36:04,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:36:05,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10626#true} is VALID [2022-04-15 12:36:05,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-15 12:36:05,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10652#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:36:05,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {10652#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10656#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:36:05,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10660#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:36:05,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10664#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:36:05,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {10664#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10668#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-15 12:36:05,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {10668#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10672#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-15 12:36:05,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {10672#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10676#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:36:05,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {10676#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10680#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-15 12:36:05,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {10680#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10684#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-15 12:36:05,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {10684#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-15 12:36:05,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} is VALID [2022-04-15 12:36:05,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 30)))} is VALID [2022-04-15 12:36:05,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 30)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10700#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-15 12:36:05,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {10700#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:36:05,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10708#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} is VALID [2022-04-15 12:36:05,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {10708#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10712#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:36:05,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {10712#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10716#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-15 12:36:05,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {10716#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10720#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-15 12:36:05,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {10720#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-15 12:36:05,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-15 12:36:05,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10732#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} is VALID [2022-04-15 12:36:05,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {10732#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10736#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-15 12:36:05,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {10736#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10740#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-15 12:36:05,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {10740#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10744#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-15 12:36:05,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {10744#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10748#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-15 12:36:05,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {10748#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} is VALID [2022-04-15 12:36:05,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-15 12:36:05,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10760#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-15 12:36:05,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {10760#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10764#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-15 12:36:05,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {10764#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10768#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-15 12:36:05,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {10768#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10772#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-15 12:36:05,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10776#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} is VALID [2022-04-15 12:36:05,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {10776#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} is VALID [2022-04-15 12:36:05,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:36:05,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-15 12:36:05,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-15 12:36:05,802 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-15 12:36:05,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:36:26,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-15 12:36:26,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-15 12:36:26,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {10797#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:36:26,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10797#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:36:26,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:26,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:27,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:27,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:27,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:36:27,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-15 12:36:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2022-04-15 12:36:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:36:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460124342] [2022-04-15 12:36:27,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:36:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115200386] [2022-04-15 12:36:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115200386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:36:27,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:36:27,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5] total 38 [2022-04-15 12:36:27,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:36:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774085437] [2022-04-15 12:36:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774085437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:36:27,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:36:27,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:36:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288398537] [2022-04-15 12:36:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:36:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:36:27,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:36:27,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:27,173 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-15 12:36:27,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:36:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:36:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:36:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:36:27,174 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:36,987 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:36:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:36:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:36:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:36:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 12:36:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 12:36:36,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-15 12:36:37,117 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-15 12:36:37,118 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:36:37,118 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:36:37,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:36:37,119 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:36:37,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 12:36:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:36:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:36:37,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:36:37,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:37,165 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:37,165 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:37,165 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:36:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:36:37,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:37,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:37,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:36:37,166 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:36:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:37,167 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:36:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:36:37,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:37,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:37,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:36:37,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:36:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 12:36:37,168 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 12:36:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:36:37,168 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 12:36:37,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:37,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 12:36:37,405 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-15 12:36:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:36:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:36:37,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:36:37,406 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:36:37,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 12:36:37,609 WARN L460 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-15 12:36:37,610 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:36:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:36:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 55 times [2022-04-15 12:36:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:36:37,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182436750] [2022-04-15 12:36:37,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:36:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 56 times [2022-04-15 12:36:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:36:37,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589200848] [2022-04-15 12:36:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:36:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:36:37,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:36:37,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499625449] [2022-04-15 12:36:37,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:36:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:36:37,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:36:37,628 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-15 12:36:37,636 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-15 12:36:37,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:36:37,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:36:37,698 WARN L261 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-15 12:36:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:36:37,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:36:38,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-15 12:36:38,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11225#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:36:38,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {11225#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11229#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:36:38,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {11229#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11233#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:36:38,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {11233#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11237#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:36:38,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {11237#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11241#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-15 12:36:38,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {11241#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:36:38,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-15 12:36:38,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11253#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:36:38,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:36:38,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-15 12:36:38,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11265#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:36:38,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {11265#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11269#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-15 12:36:38,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {11269#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11273#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-15 12:36:38,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {11273#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11277#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-15 12:36:38,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {11277#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-15 12:36:38,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11285#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:36:38,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {11285#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:36:38,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11293#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-15 12:36:38,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {11293#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11297#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-15 12:36:38,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {11297#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} is VALID [2022-04-15 12:36:38,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-15 12:36:38,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11309#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-15 12:36:38,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {11309#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11313#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-15 12:36:38,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {11313#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11317#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-15 12:36:38,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {11317#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11321#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-15 12:36:38,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {11321#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11325#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:36:38,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {11325#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11329#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} is VALID [2022-04-15 12:36:38,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {11329#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-15 12:36:38,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-15 12:36:38,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11341#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-15 12:36:38,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {11341#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11345#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-15 12:36:38,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {11345#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11349#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-15 12:36:38,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {11349#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11353#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-15 12:36:38,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {11353#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2022-04-15 12:36:38,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:36:38,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-15 12:36:38,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-15 12:36:38,718 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-15 12:36:38,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:37:02,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-15 12:37:02,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-15 12:37:02,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {11374#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:37:02,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11374#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:37:02,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:02,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:03,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-15 12:37:03,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11199#true} is VALID [2022-04-15 12:37:03,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-15 12:37:03,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-15 12:37:03,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-15 12:37:03,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11199#true} is VALID [2022-04-15 12:37:03,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-15 12:37:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-15 12:37:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:37:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589200848] [2022-04-15 12:37:03,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:37:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499625449] [2022-04-15 12:37:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499625449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:37:03,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:37:03,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 5] total 39 [2022-04-15 12:37:03,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:37:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182436750] [2022-04-15 12:37:03,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182436750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:37:03,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:37:03,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:37:03,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579121858] [2022-04-15 12:37:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:37:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:37:03,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:37:03,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:03,306 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-15 12:37:03,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:37:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:37:03,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:37:03,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:37:03,307 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:16,767 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:37:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:37:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:37:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:37:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-15 12:37:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-15 12:37:16,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-15 12:37:17,018 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-15 12:37:17,019 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:37:17,019 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:37:17,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 33 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:37:17,020 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:37:17,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 12:37:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:37:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 12:37:17,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:37:17,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:17,085 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:17,085 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:17,086 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:37:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:37:17,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:37:17,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:37:17,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:37:17,086 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:37:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:17,087 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:37:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:37:17,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:37:17,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:37:17,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:37:17,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:37:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 12:37:17,088 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 12:37:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:37:17,089 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 12:37:17,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:17,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 12:37:17,377 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-15 12:37:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:37:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:37:17,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:37:17,378 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:37:17,395 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-15 12:37:17,580 WARN L460 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-15 12:37:17,581 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:37:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:37:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 57 times [2022-04-15 12:37:17,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:37:17,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266060400] [2022-04-15 12:37:17,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:37:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 58 times [2022-04-15 12:37:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:37:17,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809715285] [2022-04-15 12:37:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:37:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:37:17,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:37:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966512589] [2022-04-15 12:37:17,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:37:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:37:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:37:17,599 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-15 12:37:17,600 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-15 12:37:17,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:37:17,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:37:17,676 WARN L261 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-15 12:37:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:37:17,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:37:18,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-15 12:37:18,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11785#true} is VALID [2022-04-15 12:37:18,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-15 12:37:18,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-15 12:37:18,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-15 12:37:18,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11785#true} is VALID [2022-04-15 12:37:18,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-15 12:37:18,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11811#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:37:18,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11815#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:37:18,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {11815#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11819#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-15 12:37:18,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {11819#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11823#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} is VALID [2022-04-15 12:37:18,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {11823#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11827#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} is VALID [2022-04-15 12:37:18,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11831#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-15 12:37:18,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11835#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-15 12:37:18,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {11835#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11839#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-15 12:37:18,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {11839#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11843#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:37:18,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {11843#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11847#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-15 12:37:18,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {11847#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 10))} is VALID [2022-04-15 12:37:18,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-15 12:37:18,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11859#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-15 12:37:18,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {11859#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11863#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:37:18,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {11863#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:37:18,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11871#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:37:18,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {11871#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11875#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:37:18,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {11875#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} is VALID [2022-04-15 12:37:18,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-15 12:37:18,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11887#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-15 12:37:18,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {11887#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-15 12:37:18,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} is VALID [2022-04-15 12:37:18,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-15 12:37:18,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11903#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-15 12:37:18,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {11903#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11907#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-15 12:37:18,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {11907#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11911#(and (= (+ (- 1) main_~main__i~0) 25) (= main_~main__sum~0 (+ 299 main_~main__i~0)))} is VALID [2022-04-15 12:37:18,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {11911#(and (= (+ (- 1) main_~main__i~0) 25) (= main_~main__sum~0 (+ 299 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 25))} is VALID [2022-04-15 12:37:18,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 25))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11919#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-15 12:37:18,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {11919#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11923#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-15 12:37:18,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {11923#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11927#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-15 12:37:18,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {11927#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11931#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-15 12:37:18,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {11931#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11935#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-15 12:37:18,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {11935#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11939#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-15 12:37:18,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {11939#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11943#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} is VALID [2022-04-15 12:37:18,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {11943#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= main_~main__i~0 35))} is VALID [2022-04-15 12:37:18,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= main_~main__i~0 35))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:37:18,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-15 12:37:18,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-15 12:37:18,755 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-15 12:37:18,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:37:48,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-15 12:37:48,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-15 12:37:48,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {11964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:37:48,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:37:48,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:37:48,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-15 12:37:48,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11785#true} is VALID [2022-04-15 12:37:48,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-15 12:37:48,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-15 12:37:48,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-15 12:37:48,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11785#true} is VALID [2022-04-15 12:37:48,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-15 12:37:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2022-04-15 12:37:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:37:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809715285] [2022-04-15 12:37:48,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:37:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966512589] [2022-04-15 12:37:48,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966512589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:37:48,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:37:48,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 5] total 40 [2022-04-15 12:37:48,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:37:48,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266060400] [2022-04-15 12:37:48,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266060400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:37:48,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:37:48,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:37:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638661530] [2022-04-15 12:37:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:37:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:37:48,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:37:48,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:49,078 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-15 12:37:49,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:37:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:37:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:37:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:37:49,079 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:38:06,059 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:38:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:38:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:38:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:38:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-15 12:38:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-15 12:38:06,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-15 12:38:06,264 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-15 12:38:06,264 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:38:06,264 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:38:06,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:38:06,265 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:38:06,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 298 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-15 12:38:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:38:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:38:06,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:38:06,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,314 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,315 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:38:06,315 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:38:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:38:06,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:38:06,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:38:06,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:38:06,316 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:38:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:38:06,316 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:38:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:38:06,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:38:06,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:38:06,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:38:06,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:38:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 12:38:06,317 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 12:38:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:38:06,317 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 12:38:06,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:06,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 12:38:06,600 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-15 12:38:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:38:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:38:06,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:38:06,600 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:38:06,617 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-15 12:38:06,801 WARN L460 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-15 12:38:06,801 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:38:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:38:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 59 times [2022-04-15 12:38:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:38:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169168513] [2022-04-15 12:38:06,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:38:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 60 times [2022-04-15 12:38:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:38:06,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8565318] [2022-04-15 12:38:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:38:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:38:06,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:38:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655554721] [2022-04-15 12:38:06,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:38:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:38:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:38:06,840 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-15 12:38:06,854 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-15 12:38:06,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:38:06,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:38:06,921 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-15 12:38:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:38:06,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:38:08,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-15 12:38:08,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12410#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:38:08,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {12410#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12414#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 12:38:08,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {12414#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12418#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:38:08,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {12418#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12422#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:38:08,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {12422#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:38:08,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 12:38:08,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:38:08,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:38:08,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:38:08,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12446#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:38:08,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {12446#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12450#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-15 12:38:08,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12454#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-15 12:38:08,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {12454#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:38:08,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:38:08,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12466#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-15 12:38:08,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {12466#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-15 12:38:08,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-15 12:38:08,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12478#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-15 12:38:08,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {12478#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-15 12:38:08,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12486#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-15 12:38:08,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {12486#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} is VALID [2022-04-15 12:38:08,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12494#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} is VALID [2022-04-15 12:38:08,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {12494#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-15 12:38:08,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12502#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-15 12:38:08,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 24))} is VALID [2022-04-15 12:38:08,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12510#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} is VALID [2022-04-15 12:38:08,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:38:08,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-15 12:38:08,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-15 12:38:08,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} is VALID [2022-04-15 12:38:08,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~0) 30))} is VALID [2022-04-15 12:38:08,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~0) 30))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 32 main_~main__i~0))} is VALID [2022-04-15 12:38:08,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} is VALID [2022-04-15 12:38:08,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} is VALID [2022-04-15 12:38:08,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12546#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} is VALID [2022-04-15 12:38:08,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {12546#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 main_~main__n~0))} is VALID [2022-04-15 12:38:08,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:38:08,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-15 12:38:08,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-15 12:38:08,131 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-15 12:38:08,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:38:48,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-15 12:38:48,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-15 12:38:48,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {12567#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:38:48,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12567#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:38:48,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:48,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:48,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:48,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:38:49,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-15 12:38:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-15 12:38:49,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:38:49,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8565318] [2022-04-15 12:38:49,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:38:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655554721] [2022-04-15 12:38:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655554721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:38:49,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:38:49,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 5] total 41 [2022-04-15 12:38:49,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:38:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169168513] [2022-04-15 12:38:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169168513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:38:49,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:38:49,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:38:49,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117831180] [2022-04-15 12:38:49,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:38:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:38:49,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:38:49,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:50,076 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-15 12:38:50,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:38:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:38:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:38:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:38:50,077 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:10,652 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:39:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:39:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:39:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-15 12:39:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-15 12:39:10,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2022-04-15 12:39:10,961 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-15 12:39:10,962 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:39:10,962 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:39:10,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:39:10,963 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:10,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-04-15 12:39:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:39:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 12:39:11,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:11,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:11,027 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:11,028 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:11,028 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:39:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:39:11,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:11,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:11,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:39:11,029 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:39:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:11,030 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:39:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:39:11,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:11,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:11,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:11,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 12:39:11,031 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 12:39:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:11,031 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 12:39:11,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:11,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 12:39:11,362 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-15 12:39:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:39:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:39:11,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:11,362 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:11,379 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-15 12:39:11,563 WARN L460 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-15 12:39:11,563 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 61 times [2022-04-15 12:39:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:11,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792124919] [2022-04-15 12:39:11,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:39:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 62 times [2022-04-15 12:39:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:11,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454006802] [2022-04-15 12:39:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:11,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:39:11,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67972220] [2022-04-15 12:39:11,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:39:11,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:11,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:11,593 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-15 12:39:11,594 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-15 12:39:11,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:39:11,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:11,666 WARN L261 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-15 12:39:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:11,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:13,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-15 12:39:13,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12996#true} is VALID [2022-04-15 12:39:13,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-15 12:39:13,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-15 12:39:13,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-15 12:39:13,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12996#true} is VALID [2022-04-15 12:39:13,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-15 12:39:13,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13022#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:39:13,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {13022#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13026#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:39:13,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {13026#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13030#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 12:39:13,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {13030#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-15 12:39:13,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13038#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-15 12:39:13,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {13038#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:39:13,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-15 12:39:13,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) (- 22))))} is VALID [2022-04-15 12:39:13,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13054#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:39:13,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {13054#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13058#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-15 12:39:13,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {13058#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13062#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-15 12:39:13,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {13062#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:39:13,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13070#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-15 12:39:13,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {13070#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13074#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:39:13,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {13074#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} is VALID [2022-04-15 12:39:13,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:39:13,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-15 12:39:13,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13090#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-15 12:39:13,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {13090#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13094#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-15 12:39:13,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {13094#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-15 12:39:13,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) main_~main__i~0) 20))} is VALID [2022-04-15 12:39:13,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13106#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-15 12:39:13,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {13106#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13110#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-15 12:39:13,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {13110#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13114#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-15 12:39:13,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {13114#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13118#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-15 12:39:13,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {13118#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-15 12:39:13,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} is VALID [2022-04-15 12:39:13,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~0)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:39:13,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~0)) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 5 main_~main__i~0))))} is VALID [2022-04-15 12:39:13,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13138#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-15 12:39:13,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {13138#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ main_~main__sum~0 (- 435))))} is VALID [2022-04-15 12:39:13,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ main_~main__sum~0 (- 435))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} is VALID [2022-04-15 12:39:13,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:39:13,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} is VALID [2022-04-15 12:39:13,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13158#(and (= (+ (* 5 main_~main__i~0) 420) main_~main__sum~0) (= 30 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-15 12:39:13,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {13158#(and (= (+ (* 5 main_~main__i~0) 420) main_~main__sum~0) (= 30 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:39:13,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 main_~main__n~0))} is VALID [2022-04-15 12:39:13,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:39:13,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-15 12:39:13,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-15 12:39:13,137 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-15 12:39:13,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:40:11,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-15 12:40:11,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-15 12:40:11,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {13183#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:40:11,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13183#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:40:11,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:11,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:40:12,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-15 12:40:12,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12996#true} is VALID [2022-04-15 12:40:12,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-15 12:40:12,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-15 12:40:12,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-15 12:40:12,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12996#true} is VALID [2022-04-15 12:40:12,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-15 12:40:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-15 12:40:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:40:12,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454006802] [2022-04-15 12:40:12,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:40:12,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67972220] [2022-04-15 12:40:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67972220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:40:12,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:40:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 5] total 42 [2022-04-15 12:40:12,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:40:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792124919] [2022-04-15 12:40:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792124919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:40:12,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:40:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:40:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124525478] [2022-04-15 12:40:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:40:12,507 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:40:12,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:40:12,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:12,745 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-15 12:40:12,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:40:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:40:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:40:12,746 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:40,397 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:40:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:40:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:40:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:40:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-15 12:40:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-15 12:40:40,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2022-04-15 12:40:40,758 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-15 12:40:40,759 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:40:40,759 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:40:40,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 55.5s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:40:40,760 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:40:40,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-04-15 12:40:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:40:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:40:40,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:40:40,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,825 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,825 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:40,826 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:40:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:40:40,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:40,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:40,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:40:40,827 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:40:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:40,827 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:40:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:40:40,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:40,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:40,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:40:40,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:40:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 12:40:40,829 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 12:40:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:40:40,829 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 12:40:40,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:40:40,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 12:40:41,219 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-15 12:40:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:40:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:40:41,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:40:41,220 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:40:41,247 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-15 12:40:41,420 WARN L460 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-15 12:40:41,420 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:40:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:40:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 63 times [2022-04-15 12:40:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:41,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1901882133] [2022-04-15 12:40:41,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:40:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 64 times [2022-04-15 12:40:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:40:41,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110153036] [2022-04-15 12:40:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:40:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:40:41,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:40:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186686806] [2022-04-15 12:40:41,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:40:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:40:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:40:41,443 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-15 12:40:41,455 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-15 12:40:41,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:40:41,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:40:41,550 WARN L261 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-15 12:40:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:41,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:40:42,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-15 12:40:42,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {13621#true} is VALID [2022-04-15 12:40:42,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-15 12:40:42,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-15 12:40:42,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-15 12:40:42,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13621#true} is VALID [2022-04-15 12:40:42,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-15 12:40:42,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:40:42,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {13647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13651#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 12:40:42,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {13651#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13655#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:40:42,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {13655#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13659#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:40:42,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {13659#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13663#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-15 12:40:42,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {13663#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13667#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-15 12:40:42,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {13667#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13671#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-15 12:40:42,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {13671#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 12:40:42,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13679#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:40:42,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {13679#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-15 12:40:42,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13687#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} is VALID [2022-04-15 12:40:42,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {13687#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13691#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:40:42,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {13691#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13695#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-15 12:40:42,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {13695#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13699#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-15 12:40:42,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {13699#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13703#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-15 12:40:42,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {13703#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13707#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:40:42,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {13707#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:40:42,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13715#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:40:42,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {13715#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:40:42,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} is VALID [2022-04-15 12:40:42,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13727#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-15 12:40:42,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {13727#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13731#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-15 12:40:42,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {13731#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13735#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-15 12:40:42,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {13735#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13739#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-15 12:40:42,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {13739#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13743#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-15 12:40:42,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {13743#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13747#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-15 12:40:42,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {13747#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13751#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} is VALID [2022-04-15 12:40:42,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {13751#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 28 main_~main__i~0))} is VALID [2022-04-15 12:40:42,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13759#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-15 12:40:42,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-15 12:40:42,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} is VALID [2022-04-15 12:40:42,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-15 12:40:42,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:40:42,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0))} is VALID [2022-04-15 12:40:42,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-15 12:40:42,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13787#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-15 12:40:42,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {13787#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} is VALID [2022-04-15 12:40:42,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= main_~main__i~0 38))} is VALID [2022-04-15 12:40:42,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= main_~main__i~0 38))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:40:42,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-15 12:40:42,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-15 12:40:42,982 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-15 12:40:42,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:41:52,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-15 12:41:52,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-15 12:41:52,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {13812#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:41:52,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13812#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:41:52,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:52,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:41:53,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {13621#true} is VALID [2022-04-15 12:41:53,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-15 12:41:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-15 12:41:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:41:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110153036] [2022-04-15 12:41:53,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:41:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186686806] [2022-04-15 12:41:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186686806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:41:53,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:41:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 43 [2022-04-15 12:41:53,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:41:53,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1901882133] [2022-04-15 12:41:53,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1901882133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:41:53,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:41:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:41:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795514706] [2022-04-15 12:41:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:41:53,855 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:41:53,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:41:53,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:54,130 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-15 12:41:54,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:41:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:41:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:41:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:41:54,131 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:42:24,856 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:42:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:42:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:42:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:42:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-15 12:42:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-15 12:42:24,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2022-04-15 12:42:25,152 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-15 12:42:25,153 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:42:25,153 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:42:25,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 37 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:42:25,154 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:42:25,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2022-04-15 12:42:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:42:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 12:42:25,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:42:25,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:25,210 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:25,210 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:42:25,210 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:42:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:42:25,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:42:25,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:42:25,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:42:25,211 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:42:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:42:25,212 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:42:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:42:25,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:42:25,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:42:25,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:42:25,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:42:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 12:42:25,212 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 12:42:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:42:25,213 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 12:42:25,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:42:25,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 12:42:25,598 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-15 12:42:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:42:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:42:25,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:42:25,599 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:42:25,628 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-15 12:42:25,811 WARN L460 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-15 12:42:25,811 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:42:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:42:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 65 times [2022-04-15 12:42:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:42:25,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274005177] [2022-04-15 12:42:25,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:42:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 66 times [2022-04-15 12:42:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:42:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388406402] [2022-04-15 12:42:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:42:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:42:25,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:42:25,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147852321] [2022-04-15 12:42:25,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:42:25,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:42:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:42:25,834 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-15 12:42:25,836 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-15 12:42:25,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 12:42:25,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:42:25,932 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-15 12:42:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:42:25,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:42:27,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-15 12:42:27,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14259#true} is VALID [2022-04-15 12:42:27,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-15 12:42:27,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-15 12:42:27,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-15 12:42:27,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14259#true} is VALID [2022-04-15 12:42:27,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-15 12:42:27,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14285#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:42:27,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14289#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:42:27,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {14289#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14293#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:42:27,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {14293#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14297#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 12:42:27,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {14297#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14301#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:42:27,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {14301#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14305#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-15 12:42:27,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {14305#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14309#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-15 12:42:27,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {14309#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14313#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:42:27,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {14313#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14317#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:42:27,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {14317#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 25))))} is VALID [2022-04-15 12:42:27,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 25))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14325#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:42:27,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {14325#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14329#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:42:27,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {14329#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14333#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-15 12:42:27,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {14333#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14337#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-15 12:42:27,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {14337#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14341#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:42:27,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {14341#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14345#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-15 12:42:27,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {14345#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-15 12:42:27,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14353#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-15 12:42:27,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14357#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} is VALID [2022-04-15 12:42:27,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {14357#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14361#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:42:27,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {14361#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14365#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-15 12:42:27,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {14365#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14369#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-15 12:42:27,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {14369#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-15 12:42:27,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:42:27,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} is VALID [2022-04-15 12:42:27,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14385#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-15 12:42:27,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {14385#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14389#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} is VALID [2022-04-15 12:42:27,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {14389#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14393#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-15 12:42:27,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {14393#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-15 12:42:27,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14401#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-15 12:42:27,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {14401#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:42:27,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 28))} is VALID [2022-04-15 12:42:27,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14413#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-15 12:42:27,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {14413#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14417#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} is VALID [2022-04-15 12:42:27,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {14417#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:42:27,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14425#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} is VALID [2022-04-15 12:42:27,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-15 12:42:27,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} is VALID [2022-04-15 12:42:27,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} is VALID [2022-04-15 12:42:27,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:42:27,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-15 12:42:27,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-15 12:42:27,350 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-15 12:42:27,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:43:46,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-15 12:43:46,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-15 12:43:46,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {14454#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:43:46,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14454#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:43:46,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:46,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:47,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:48,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:48,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:43:48,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-15 12:43:48,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-15 12:43:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-15 12:43:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:43:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388406402] [2022-04-15 12:43:48,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:43:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147852321] [2022-04-15 12:43:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147852321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:43:48,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:43:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 5] total 44 [2022-04-15 12:43:48,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:43:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274005177] [2022-04-15 12:43:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274005177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:43:48,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:43:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:43:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966364569] [2022-04-15 12:43:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:43:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:43:48,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:43:48,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:43:48,349 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-15 12:43:48,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:43:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:43:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:43:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:43:48,350 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:28,239 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:44:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:44:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:44:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:44:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-15 12:44:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-15 12:44:28,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2022-04-15 12:44:28,588 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-15 12:44:28,589 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:44:28,589 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:44:28,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 76.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:44:28,590 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:44:28,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 330 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 21.1s Time] [2022-04-15 12:44:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:44:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:44:28,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:44:28,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,643 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,643 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:28,644 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:44:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:44:28,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:44:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:44:28,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:44:28,644 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:44:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:28,645 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:44:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:44:28,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:44:28,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:44:28,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:44:28,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:44:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 12:44:28,646 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 12:44:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:44:28,646 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 12:44:28,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:28,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 12:44:29,255 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-15 12:44:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:44:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:44:29,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:44:29,256 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:44:29,280 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-15 12:44:29,456 WARN L460 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-15 12:44:29,457 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:44:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:44:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 67 times [2022-04-15 12:44:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:44:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1068898633] [2022-04-15 12:44:29,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:44:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 68 times [2022-04-15 12:44:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:44:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851293157] [2022-04-15 12:44:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:44:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:44:29,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:44:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817583515] [2022-04-15 12:44:29,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:44:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:44:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:44:29,481 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-15 12:44:29,482 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-15 12:44:29,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:44:29,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:44:29,549 WARN L261 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 164 conjunts are in the unsatisfiable core [2022-04-15 12:44:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:29,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:44:31,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14910#true} is VALID [2022-04-15 12:44:31,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-15 12:44:31,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14936#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 12:44:31,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {14936#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14940#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 12:44:31,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {14940#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14944#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-15 12:44:31,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {14944#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14948#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-15 12:44:31,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {14948#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-15 12:44:31,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {14952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 12:44:31,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14960#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-15 12:44:31,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {14960#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14964#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-15 12:44:31,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {14964#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14968#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-15 12:44:31,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {14968#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14972#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-15 12:44:31,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {14972#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14976#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-15 12:44:31,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {14976#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14980#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-15 12:44:31,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {14980#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14984#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-15 12:44:31,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {14984#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14988#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-15 12:44:31,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {14988#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14992#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} is VALID [2022-04-15 12:44:31,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {14992#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14996#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-15 12:44:31,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {14996#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15000#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-15 12:44:31,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {15000#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15008#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-15 12:44:31,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {15008#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-15 12:44:31,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15016#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-15 12:44:31,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {15016#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15020#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-15 12:44:31,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {15020#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-15 12:44:31,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) main_~main__sum~0 (* (- 3) main_~main__i~0))))} is VALID [2022-04-15 12:44:31,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) main_~main__sum~0 (* (- 3) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} is VALID [2022-04-15 12:44:31,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 5) main_~main__i~0))))} is VALID [2022-04-15 12:44:31,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 6) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 6) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 22 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-15 12:44:31,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 22 (+ main_~main__i~0 (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15056#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-15 12:44:31,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {15056#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} is VALID [2022-04-15 12:44:31,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-15 12:44:31,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-15 12:44:31,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} is VALID [2022-04-15 12:44:31,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-15 12:44:31,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} is VALID [2022-04-15 12:44:31,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 39 main_~main__i~0))} is VALID [2022-04-15 12:44:31,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 main_~main__n~0))} is VALID [2022-04-15 12:44:31,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:44:31,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-15 12:44:31,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-15 12:44:31,302 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-15 12:44:31,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:01,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-15 12:46:01,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-15 12:46:01,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {15109#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:46:01,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15109#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 12:46:01,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:01,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:02,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 12:46:03,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14910#true} is VALID [2022-04-15 12:46:03,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-15 12:46:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-04-15 12:46:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851293157] [2022-04-15 12:46:03,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:46:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817583515] [2022-04-15 12:46:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817583515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:03,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:46:03,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 5] total 45 [2022-04-15 12:46:03,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1068898633] [2022-04-15 12:46:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1068898633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:03,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:03,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:46:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085191865] [2022-04-15 12:46:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:46:03,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:03,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:03,688 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-15 12:46:03,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:46:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:46:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:46:03,689 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)