/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 -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:44:07,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:44:07,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:44:08,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:44:08,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:44:08,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:44:08,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:44:08,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:44:08,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:44:08,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:44:08,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:44:08,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:44:08,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:44:08,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:44:08,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:44:08,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:44:08,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:44:08,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:44:08,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:44:08,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:44:08,050 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:44:08,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:44:08,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:44:08,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:44:08,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:44:08,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:44:08,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:44:08,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:44:08,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:44:08,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:44:08,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:44:08,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:44:08,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:44:08,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:44:08,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:44:08,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:44:08,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:44:08,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:44:08,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:44:08,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:44:08,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:44:08,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:44:08,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:44:08,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:44:08,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:44:08,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:44:08,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:44:08,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:44:08,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:44:08,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:44:08,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:44:08,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:44:08,076 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:44:08,076 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-08 09:44:08,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:44:08,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:44:08,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:44:08,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:44:08,312 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:44:08,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-08 09:44:08,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ed1d982/bf14d3f739a24628acbc1fbc5e98d675/FLAGd011fd403 [2022-04-08 09:44:08,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:44:08,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-08 09:44:08,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ed1d982/bf14d3f739a24628acbc1fbc5e98d675/FLAGd011fd403 [2022-04-08 09:44:09,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ed1d982/bf14d3f739a24628acbc1fbc5e98d675 [2022-04-08 09:44:09,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:44:09,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:44:09,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:44:09,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:44:09,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:44:09,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e3c938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09, skipping insertion in model container [2022-04-08 09:44:09,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:44:09,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:44:09,353 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[891,904] [2022-04-08 09:44:09,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:44:09,383 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:44:09,393 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[891,904] [2022-04-08 09:44:09,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:44:09,411 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:44:09,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09 WrapperNode [2022-04-08 09:44:09,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:44:09,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:44:09,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:44:09,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:44:09,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:44:09,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:44:09,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:44:09,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:44:09,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (1/1) ... [2022-04-08 09:44:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:44:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:09,475 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-08 09:44:09,497 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-08 09:44:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:44:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:44:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:44:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:44:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:44:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:44:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:44:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:44:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:44:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:44:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:44:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:44:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:44:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:44:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:44:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:44:09,564 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:44:09,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:44:09,661 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:44:09,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:44:09,666 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:44:09,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:44:09 BoogieIcfgContainer [2022-04-08 09:44:09,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:44:09,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:44:09,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:44:09,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:44:09,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:44:09" (1/3) ... [2022-04-08 09:44:09,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d90c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:44:09, skipping insertion in model container [2022-04-08 09:44:09,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:44:09" (2/3) ... [2022-04-08 09:44:09,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d90c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:44:09, skipping insertion in model container [2022-04-08 09:44:09,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:44:09" (3/3) ... [2022-04-08 09:44:09,672 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i [2022-04-08 09:44:09,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:44:09,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:44:09,702 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:44:09,706 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-08 09:44:09,706 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:44:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:44:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:44:09,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:09,723 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:09,723 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-08 09:44:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:09,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237632429] [2022-04-08 09:44:09,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:44:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-08 09:44:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561262680] [2022-04-08 09:44:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:09,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14700527] [2022-04-08 09:44:09,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:09,822 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-08 09:44:09,836 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-08 09:44:09,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:44:09,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:44:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:09,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:09,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-08 09:44:09,984 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(9, 2); {24#true} is VALID [2022-04-08 09:44:09,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:44:09,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-08 09:44:09,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-08 09:44:09,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-08 09:44:09,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:44:09,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 <= ~n~0); {25#false} is VALID [2022-04-08 09:44:09,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {25#false} is VALID [2022-04-08 09:44:09,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 09:44:09,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 09:44:09,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 09:44:09,988 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-08 09:44:09,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:44:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561262680] [2022-04-08 09:44:09,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14700527] [2022-04-08 09:44:09,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14700527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:09,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:09,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:44:09,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237632429] [2022-04-08 09:44:09,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237632429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:09,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:09,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:44:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543224488] [2022-04-08 09:44:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:44:09,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:09,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:44:10,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:44:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:44:10,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:44:10,033 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:10,126 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 09:44:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:44:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:44:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 09:44:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 09:44:10,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-08 09:44:10,182 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-08 09:44:10,187 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:44:10,187 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:44:10,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:44:10,196 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:10,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:44:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:44:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-08 09:44:10,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:10,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,219 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,219 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:10,221 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:44:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:44:10,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:10,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:10,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:44:10,222 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:44:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:10,224 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:44:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:44:10,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:10,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:10,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:10,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:44:10,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-08 09:44:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:10,227 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:44:10,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:44:10,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:44:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:44:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:44:10,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:10,239 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:10,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:44:10,455 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-08 09:44:10,456 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-08 09:44:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:10,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148541212] [2022-04-08 09:44:10,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:10,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 2 times [2022-04-08 09:44:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27112317] [2022-04-08 09:44:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:10,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690367236] [2022-04-08 09:44:10,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:10,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:10,506 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-08 09:44:10,507 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-08 09:44:10,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:10,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:10,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:44:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:10,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:10,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-08 09:44:10,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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(9, 2); {194#true} is VALID [2022-04-08 09:44:10,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-08 09:44:10,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-08 09:44:10,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret3 := main(); {194#true} is VALID [2022-04-08 09:44:10,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-08 09:44:10,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:10,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {221#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:10,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {225#(and (<= 1 main_~n~0) (<= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2022-04-08 09:44:10,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(and (<= 1 main_~n~0) (<= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !(~i~0 <= ~n~0); {229#(and (<= 1 main_~n~0) (= main_~sum~0 1) (< main_~n~0 (+ main_~sum~0 1)))} is VALID [2022-04-08 09:44:10,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#(and (<= 1 main_~n~0) (= main_~sum~0 1) (< main_~n~0 (+ main_~sum~0 1)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:10,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:10,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-08 09:44:10,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-08 09:44:10,898 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-08 09:44:10,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:11,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-08 09:44:11,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-08 09:44:11,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:11,094 INFO L272 TraceCheckUtils]: 10: Hoare triple {253#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:11,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {253#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:11,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {257#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:11,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {261#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:11,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {265#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} is VALID [2022-04-08 09:44:11,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-08 09:44:11,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret3 := main(); {194#true} is VALID [2022-04-08 09:44:11,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-08 09:44:11,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-08 09:44:11,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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(9, 2); {194#true} is VALID [2022-04-08 09:44:11,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-08 09:44:11,098 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-08 09:44:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:11,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27112317] [2022-04-08 09:44:11,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:11,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690367236] [2022-04-08 09:44:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690367236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:11,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:11,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-08 09:44:11,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148541212] [2022-04-08 09:44:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148541212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:11,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:11,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:44:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424903233] [2022-04-08 09:44:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:11,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:44:11,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:11,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:44:11,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:44:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:44:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:44:11,112 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:11,212 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:44:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:44:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:44:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:44:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:44:11,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 09:44:11,231 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-08 09:44:11,231 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:44:11,231 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:44:11,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:44:11,232 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:11,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:44:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:44:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:44:11,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:11,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,237 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,238 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:11,239 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:44:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:44:11,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:11,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:11,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:44:11,239 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:44:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:11,240 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:44:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:44:11,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:11,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:11,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:11,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:44:11,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-08 09:44:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:11,242 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:44:11,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:11,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:44:11,252 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-08 09:44:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:44:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:44:11,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:11,252 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:11,271 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-08 09:44:11,468 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-08 09:44:11,469 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 3 times [2022-04-08 09:44:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:11,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202187264] [2022-04-08 09:44:11,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:11,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 4 times [2022-04-08 09:44:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:11,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759381697] [2022-04-08 09:44:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:11,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:11,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990910162] [2022-04-08 09:44:11,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:44:11,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:11,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:11,491 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-08 09:44:11,492 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-08 09:44:11,521 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:44:11,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 09:44:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:11,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:11,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2022-04-08 09:44:11,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#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(9, 2); {405#true} is VALID [2022-04-08 09:44:11,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2022-04-08 09:44:11,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #55#return; {405#true} is VALID [2022-04-08 09:44:11,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret3 := main(); {405#true} is VALID [2022-04-08 09:44:11,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {405#true} is VALID [2022-04-08 09:44:11,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {428#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:11,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {432#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:11,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {432#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {436#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:11,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {440#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:11,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {444#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} is VALID [2022-04-08 09:44:11,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} assume !(~i~0 <= ~n~0); {448#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2022-04-08 09:44:11,751 INFO L272 TraceCheckUtils]: 12: Hoare triple {448#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:11,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:11,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {406#false} is VALID [2022-04-08 09:44:11,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#false} assume !false; {406#false} is VALID [2022-04-08 09:44:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:11,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:14,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#false} assume !false; {406#false} is VALID [2022-04-08 09:44:14,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {406#false} is VALID [2022-04-08 09:44:14,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:14,730 INFO L272 TraceCheckUtils]: 12: Hoare triple {472#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:14,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {472#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:14,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {476#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:14,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {480#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:14,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:14,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {488#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:14,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {484#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:14,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {405#true} is VALID [2022-04-08 09:44:14,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret3 := main(); {405#true} is VALID [2022-04-08 09:44:14,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #55#return; {405#true} is VALID [2022-04-08 09:44:14,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2022-04-08 09:44:14,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#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(9, 2); {405#true} is VALID [2022-04-08 09:44:14,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2022-04-08 09:44:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:44:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759381697] [2022-04-08 09:44:14,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990910162] [2022-04-08 09:44:14,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990910162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:14,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2022-04-08 09:44:14,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202187264] [2022-04-08 09:44:14,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202187264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:14,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:44:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170511878] [2022-04-08 09:44:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:14,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:44:14,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:14,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,755 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-08 09:44:14,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:44:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:44:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:44:14,757 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:14,937 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:44:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:44:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:44:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 09:44:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 09:44:14,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-08 09:44:14,958 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-08 09:44:14,959 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:44:14,959 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 09:44:14,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:44:14,960 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:14,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:44:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 09:44:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 09:44:14,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:14,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,967 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,967 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:14,968 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:44:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:44:14,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:14,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:14,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:44:14,969 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:44:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:14,970 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:44:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:44:14,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:14,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:14,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:14,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 09:44:14,971 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-08 09:44:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:14,971 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 09:44:14,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:14,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 09:44:14,987 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-08 09:44:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:44:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:44:14,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:14,988 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:15,021 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-08 09:44:15,206 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-08 09:44:15,206 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:15,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 5 times [2022-04-08 09:44:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:15,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670192811] [2022-04-08 09:44:15,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:15,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 6 times [2022-04-08 09:44:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:15,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424774540] [2022-04-08 09:44:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:15,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:15,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833421656] [2022-04-08 09:44:15,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:44:15,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:15,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:15,239 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-08 09:44:15,239 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-08 09:44:15,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:44:15,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:15,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:44:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:15,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:15,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2022-04-08 09:44:15,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#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(9, 2); {643#true} is VALID [2022-04-08 09:44:15,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2022-04-08 09:44:15,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #55#return; {643#true} is VALID [2022-04-08 09:44:15,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret3 := main(); {643#true} is VALID [2022-04-08 09:44:15,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {643#true} is VALID [2022-04-08 09:44:15,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {643#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {666#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:15,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {666#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {670#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:15,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {674#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:44:15,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {678#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-08 09:44:15,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {682#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-08 09:44:15,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {682#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {686#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:44:15,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {686#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {690#(and (<= 3 main_~n~0) (= (+ main_~sum~0 (- 6)) 0) (<= main_~i~0 4))} is VALID [2022-04-08 09:44:15,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(and (<= 3 main_~n~0) (= (+ main_~sum~0 (- 6)) 0) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {694#(and (<= 3 main_~n~0) (< main_~n~0 4) (= (+ main_~sum~0 (- 6)) 0))} is VALID [2022-04-08 09:44:15,532 INFO L272 TraceCheckUtils]: 14: Hoare triple {694#(and (<= 3 main_~n~0) (< main_~n~0 4) (= (+ main_~sum~0 (- 6)) 0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:15,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:15,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {644#false} is VALID [2022-04-08 09:44:15,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#false} assume !false; {644#false} is VALID [2022-04-08 09:44:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:15,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:16,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {644#false} assume !false; {644#false} is VALID [2022-04-08 09:44:16,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {644#false} is VALID [2022-04-08 09:44:16,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:16,206 INFO L272 TraceCheckUtils]: 14: Hoare triple {718#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:16,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {718#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:16,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {722#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:16,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {726#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:16,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:16,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:16,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:16,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {734#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:16,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {643#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {730#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:16,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {643#true} is VALID [2022-04-08 09:44:16,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {643#true} call #t~ret3 := main(); {643#true} is VALID [2022-04-08 09:44:16,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #55#return; {643#true} is VALID [2022-04-08 09:44:16,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2022-04-08 09:44:16,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#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(9, 2); {643#true} is VALID [2022-04-08 09:44:16,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {643#true} call ULTIMATE.init(); {643#true} is VALID [2022-04-08 09:44:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:44:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:16,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424774540] [2022-04-08 09:44:16,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:16,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833421656] [2022-04-08 09:44:16,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833421656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:16,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:16,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-08 09:44:16,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670192811] [2022-04-08 09:44:16,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670192811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:16,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:16,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:44:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208015890] [2022-04-08 09:44:16,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:44:16,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:16,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,235 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-08 09:44:16,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:44:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:44:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:44:16,236 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:16,432 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 09:44:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:44:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:44:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 09:44:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 09:44:16,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-08 09:44:16,478 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-08 09:44:16,484 INFO L225 Difference]: With dead ends: 26 [2022-04-08 09:44:16,484 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:44:16,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:44:16,487 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:16,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:44:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:44:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 09:44:16,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:16,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,497 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,497 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:16,500 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:44:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:44:16,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:16,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:16,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 09:44:16,503 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 09:44:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:16,504 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:44:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:44:16,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:16,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:16,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:16,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-08 09:44:16,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-08 09:44:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:16,505 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-08 09:44:16,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:16,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-08 09:44:16,521 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-08 09:44:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:44:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:44:16,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:16,522 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:16,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 09:44:16,732 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-08 09:44:16,732 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2015805555, now seen corresponding path program 7 times [2022-04-08 09:44:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:16,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622143687] [2022-04-08 09:44:16,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:16,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2015805555, now seen corresponding path program 8 times [2022-04-08 09:44:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:16,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541610476] [2022-04-08 09:44:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:16,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869977208] [2022-04-08 09:44:16,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:16,767 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-08 09:44:16,768 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-08 09:44:16,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:16,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:16,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 09:44:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:16,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:17,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} call ULTIMATE.init(); {907#true} is VALID [2022-04-08 09:44:17,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#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(9, 2); {907#true} is VALID [2022-04-08 09:44:17,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-08 09:44:17,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} #55#return; {907#true} is VALID [2022-04-08 09:44:17,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} call #t~ret3 := main(); {907#true} is VALID [2022-04-08 09:44:17,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {907#true} is VALID [2022-04-08 09:44:17,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {930#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:17,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:17,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {938#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:44:17,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {938#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {942#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:17,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {942#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {946#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-08 09:44:17,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {950#(and (= (+ (- 2) main_~i~0) 1) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-08 09:44:17,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(and (= (+ (- 2) main_~i~0) 1) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 3) (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {954#(and (= (+ (- 5) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-08 09:44:17,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= (+ (- 5) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {958#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-08 09:44:17,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {958#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {962#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:44:17,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {962#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} assume !(~i~0 <= ~n~0); {966#(and (<= 4 main_~n~0) (= main_~sum~0 10) (< main_~n~0 5))} is VALID [2022-04-08 09:44:17,118 INFO L272 TraceCheckUtils]: 16: Hoare triple {966#(and (<= 4 main_~n~0) (= main_~sum~0 10) (< main_~n~0 5))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:17,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:17,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {908#false} is VALID [2022-04-08 09:44:17,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#false} assume !false; {908#false} is VALID [2022-04-08 09:44:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:17,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:18,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#false} assume !false; {908#false} is VALID [2022-04-08 09:44:18,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {908#false} is VALID [2022-04-08 09:44:18,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:18,024 INFO L272 TraceCheckUtils]: 16: Hoare triple {990#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:18,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {990#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:18,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {994#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:18,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {998#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:18,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:18,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:18,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:18,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:18,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:18,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1006#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:18,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1002#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:18,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {907#true} is VALID [2022-04-08 09:44:18,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} call #t~ret3 := main(); {907#true} is VALID [2022-04-08 09:44:18,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} #55#return; {907#true} is VALID [2022-04-08 09:44:18,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-08 09:44:18,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#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(9, 2); {907#true} is VALID [2022-04-08 09:44:18,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} call ULTIMATE.init(); {907#true} is VALID [2022-04-08 09:44:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 09:44:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:18,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541610476] [2022-04-08 09:44:18,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869977208] [2022-04-08 09:44:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869977208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:18,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:18,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-04-08 09:44:18,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622143687] [2022-04-08 09:44:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622143687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:18,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:18,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 09:44:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514891494] [2022-04-08 09:44:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:18,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:44:18,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:18,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,063 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-08 09:44:18,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 09:44:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 09:44:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:44:18,064 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:18,343 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:44:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 09:44:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:44:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 09:44:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 09:44:18,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-08 09:44:18,365 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-08 09:44:18,366 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:44:18,366 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:44:18,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:44:18,367 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:18,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:44:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:44:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 09:44:18,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:18,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,378 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,378 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:18,380 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:44:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:44:18,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:18,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:18,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:44:18,384 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:44:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:18,385 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:44:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:44:18,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:18,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:18,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:18,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-08 09:44:18,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-08 09:44:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:18,389 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-08 09:44:18,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:18,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-08 09:44:18,407 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-08 09:44:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:44:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:44:18,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:18,410 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:18,429 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-08 09:44:18,621 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-08 09:44:18,621 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 9 times [2022-04-08 09:44:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191002358] [2022-04-08 09:44:18,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:18,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:18,625 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 10 times [2022-04-08 09:44:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:18,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653160280] [2022-04-08 09:44:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:18,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:18,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246208254] [2022-04-08 09:44:18,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:44:18,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:18,639 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-08 09:44:18,640 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-08 09:44:18,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:44:18,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:18,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:44:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:18,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:18,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-08 09:44:18,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#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(9, 2); {1197#true} is VALID [2022-04-08 09:44:18,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-08 09:44:18,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #55#return; {1197#true} is VALID [2022-04-08 09:44:18,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret3 := main(); {1197#true} is VALID [2022-04-08 09:44:18,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1197#true} is VALID [2022-04-08 09:44:18,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1220#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:18,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1224#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:18,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1228#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:44:18,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1228#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1232#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-08 09:44:18,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1236#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:44:18,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1240#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:44:18,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1240#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1244#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:18,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1244#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1248#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:18,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1248#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1252#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:44:18,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1256#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-08 09:44:18,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1256#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1260#(and (<= main_~sum~0 (+ main_~n~0 10)) (= 5 (+ main_~sum~0 (- 10))) (<= (+ main_~i~0 9) main_~sum~0))} is VALID [2022-04-08 09:44:18,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#(and (<= main_~sum~0 (+ main_~n~0 10)) (= 5 (+ main_~sum~0 (- 10))) (<= (+ main_~i~0 9) main_~sum~0))} assume !(~i~0 <= ~n~0); {1264#(and (<= main_~sum~0 (+ main_~n~0 10)) (< (+ main_~n~0 9) main_~sum~0) (= 5 (+ main_~sum~0 (- 10))))} is VALID [2022-04-08 09:44:18,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {1264#(and (<= main_~sum~0 (+ main_~n~0 10)) (< (+ main_~n~0 9) main_~sum~0) (= 5 (+ main_~sum~0 (- 10))))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:18,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:18,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-08 09:44:18,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-08 09:44:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:18,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:20,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-08 09:44:20,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-08 09:44:20,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:20,127 INFO L272 TraceCheckUtils]: 18: Hoare triple {1288#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:20,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {1292#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1288#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:20,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1296#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1292#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:20,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1296#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:20,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:20,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:20,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:20,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:20,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:20,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:20,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:20,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1304#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:20,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1300#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:20,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1197#true} is VALID [2022-04-08 09:44:20,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret3 := main(); {1197#true} is VALID [2022-04-08 09:44:20,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #55#return; {1197#true} is VALID [2022-04-08 09:44:20,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-08 09:44:20,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#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(9, 2); {1197#true} is VALID [2022-04-08 09:44:20,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-08 09:44:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 09:44:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653160280] [2022-04-08 09:44:20,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246208254] [2022-04-08 09:44:20,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246208254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:20,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:20,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 21 [2022-04-08 09:44:20,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:20,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191002358] [2022-04-08 09:44:20,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191002358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:20,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:20,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 09:44:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173942325] [2022-04-08 09:44:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:44:20,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:20,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,178 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-08 09:44:20,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 09:44:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 09:44:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:44:20,180 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:20,532 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:44:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 09:44:20,532 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:44:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-08 09:44:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-08 09:44:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-08 09:44:20,557 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-08 09:44:20,558 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:44:20,558 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:44:20,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:44:20,559 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:20,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:44:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:44:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 09:44:20,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:20,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,573 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,573 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:20,574 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:44:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:44:20,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:20,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:20,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 09:44:20,575 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 09:44:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:20,578 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:44:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:44:20,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:20,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:20,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:20,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 09:44:20,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-08 09:44:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:20,580 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 09:44:20,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:20,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 09:44:20,600 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-08 09:44:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:44:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 09:44:20,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:20,602 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:20,621 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-08 09:44:20,818 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-08 09:44:20,819 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1190325577, now seen corresponding path program 11 times [2022-04-08 09:44:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319678501] [2022-04-08 09:44:20,822 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:20,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:20,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1190325577, now seen corresponding path program 12 times [2022-04-08 09:44:20,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:20,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022952575] [2022-04-08 09:44:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:20,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:20,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863534336] [2022-04-08 09:44:20,863 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:44:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:20,874 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-08 09:44:20,875 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-08 09:44:20,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 09:44:20,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:20,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 09:44:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:20,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:21,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1513#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(9, 2); {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #55#return; {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret3 := main(); {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1513#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1513#true} is VALID [2022-04-08 09:44:21,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1513#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1536#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:21,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1540#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:21,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1544#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:44:21,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1544#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1548#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-08 09:44:21,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:44:21,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {1552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1556#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:44:21,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {1556#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1560#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:21,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1564#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:21,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1568#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-08 09:44:21,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1568#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1572#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} is VALID [2022-04-08 09:44:21,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1576#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-08 09:44:21,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1580#(and (<= main_~i~0 main_~n~0) (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-08 09:44:21,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1580#(and (<= main_~i~0 main_~n~0) (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1584#(and (<= (+ main_~i~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} is VALID [2022-04-08 09:44:21,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {1584#(and (<= (+ main_~i~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} assume !(~i~0 <= ~n~0); {1588#(and (< (+ main_~n~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} is VALID [2022-04-08 09:44:21,294 INFO L272 TraceCheckUtils]: 20: Hoare triple {1588#(and (< (+ main_~n~0 14) main_~sum~0) (= 6 (+ (- 15) main_~sum~0)) (<= main_~sum~0 (+ main_~n~0 15)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:21,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:21,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1514#false} is VALID [2022-04-08 09:44:21,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2022-04-08 09:44:21,295 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-08 09:44:21,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:22,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2022-04-08 09:44:22,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1514#false} is VALID [2022-04-08 09:44:22,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:22,716 INFO L272 TraceCheckUtils]: 20: Hoare triple {1612#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:22,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {1616#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1612#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:22,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {1620#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1616#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:22,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1620#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:22,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:22,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:22,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:22,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:22,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1628#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:22,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1513#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1624#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:22,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1513#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1513#true} is VALID [2022-04-08 09:44:22,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {1513#true} call #t~ret3 := main(); {1513#true} is VALID [2022-04-08 09:44:22,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1513#true} {1513#true} #55#return; {1513#true} is VALID [2022-04-08 09:44:22,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#true} assume true; {1513#true} is VALID [2022-04-08 09:44:22,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {1513#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(9, 2); {1513#true} is VALID [2022-04-08 09:44:22,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2022-04-08 09:44:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 09:44:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022952575] [2022-04-08 09:44:22,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863534336] [2022-04-08 09:44:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863534336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:22,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 23 [2022-04-08 09:44:22,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319678501] [2022-04-08 09:44:22,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319678501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:22,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 09:44:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072884267] [2022-04-08 09:44:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 09:44:22,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:22,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:22,770 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-08 09:44:22,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 09:44:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 09:44:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:44:22,772 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:23,095 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 09:44:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 09:44:23,096 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 09:44:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 09:44:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 09:44:23,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-08 09:44:23,117 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-08 09:44:23,117 INFO L225 Difference]: With dead ends: 32 [2022-04-08 09:44:23,117 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:44:23,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:44:23,118 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:23,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:44:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:44:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 09:44:23,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:23,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,131 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,132 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:23,133 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:44:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:44:23,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:23,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:23,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 09:44:23,134 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 09:44:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:23,135 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:44:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:44:23,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:23,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:23,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:23,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 09:44:23,136 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-08 09:44:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:23,136 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 09:44:23,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:23,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 09:44:23,151 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-08 09:44:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:44:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:44:23,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:23,152 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:23,172 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-08 09:44:23,372 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-08 09:44:23,372 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 13 times [2022-04-08 09:44:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:23,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751008609] [2022-04-08 09:44:23,376 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:23,376 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 14 times [2022-04-08 09:44:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958338663] [2022-04-08 09:44:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:23,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:23,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612140957] [2022-04-08 09:44:23,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:23,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:23,400 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-08 09:44:23,415 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-08 09:44:23,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:23,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:23,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 09:44:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:23,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:23,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-08 09:44:23,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#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(9, 2); {1855#true} is VALID [2022-04-08 09:44:23,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-08 09:44:23,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #55#return; {1855#true} is VALID [2022-04-08 09:44:23,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret3 := main(); {1855#true} is VALID [2022-04-08 09:44:23,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1855#true} is VALID [2022-04-08 09:44:23,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1878#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:23,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {1878#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:23,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {1882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:44:23,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {1886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1890#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:44:23,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1894#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-08 09:44:23,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1898#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:44:23,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1902#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:23,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1902#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:44:23,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:44:23,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1914#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:44:23,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1918#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:44:23,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1922#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:44:23,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1922#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1926#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:44:23,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {1926#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1930#(and (<= main_~i~0 main_~n~0) (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:44:23,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {1930#(and (<= main_~i~0 main_~n~0) (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1934#(and (<= 7 main_~n~0) (<= main_~i~0 8) (= main_~sum~0 28))} is VALID [2022-04-08 09:44:23,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {1934#(and (<= 7 main_~n~0) (<= main_~i~0 8) (= main_~sum~0 28))} assume !(~i~0 <= ~n~0); {1938#(and (< main_~n~0 8) (<= 7 main_~n~0) (= main_~sum~0 28))} is VALID [2022-04-08 09:44:23,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {1938#(and (< main_~n~0 8) (<= 7 main_~n~0) (= main_~sum~0 28))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:23,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:23,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1856#false} is VALID [2022-04-08 09:44:23,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-08 09:44:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:23,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:25,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-08 09:44:25,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1856#false} is VALID [2022-04-08 09:44:25,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:25,819 INFO L272 TraceCheckUtils]: 22: Hoare triple {1962#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:25,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {1966#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {1962#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:25,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {1970#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1966#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:25,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1970#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:25,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1978#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:25,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1974#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:25,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1855#true} is VALID [2022-04-08 09:44:25,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret3 := main(); {1855#true} is VALID [2022-04-08 09:44:25,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #55#return; {1855#true} is VALID [2022-04-08 09:44:25,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-08 09:44:25,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#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(9, 2); {1855#true} is VALID [2022-04-08 09:44:25,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-08 09:44:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:44:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:25,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958338663] [2022-04-08 09:44:25,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:25,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612140957] [2022-04-08 09:44:25,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612140957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:25,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:25,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 25 [2022-04-08 09:44:25,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:25,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751008609] [2022-04-08 09:44:25,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751008609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:25,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:25,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 09:44:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235858136] [2022-04-08 09:44:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:44:25,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:25,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:25,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:44:25,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 09:44:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 09:44:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:44:25,878 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:26,402 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:44:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 09:44:26,402 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:44:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 09:44:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 09:44:26,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-08 09:44:26,429 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-08 09:44:26,429 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:44:26,429 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:44:26,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:44:26,430 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:26,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:44:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:44:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 09:44:26,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:26,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,470 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,470 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:26,471 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 09:44:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:44:26,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:26,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:26,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 09:44:26,472 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 09:44:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:26,472 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 09:44:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:44:26,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:26,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:26,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:26,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-08 09:44:26,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-08 09:44:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:26,473 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-08 09:44:26,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:26,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-08 09:44:26,500 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-08 09:44:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:44:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 09:44:26,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:26,500 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:26,526 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-08 09:44:26,715 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-08 09:44:26,716 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1640455429, now seen corresponding path program 15 times [2022-04-08 09:44:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:26,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [80485321] [2022-04-08 09:44:26,718 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:26,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1640455429, now seen corresponding path program 16 times [2022-04-08 09:44:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:26,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429433417] [2022-04-08 09:44:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:26,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455127903] [2022-04-08 09:44:26,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:44:26,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:26,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:26,743 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-08 09:44:26,744 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-08 09:44:26,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:44:26,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:26,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 09:44:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:26,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:27,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-08 09:44:27,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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(9, 2); {2223#true} is VALID [2022-04-08 09:44:27,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 09:44:27,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #55#return; {2223#true} is VALID [2022-04-08 09:44:27,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret3 := main(); {2223#true} is VALID [2022-04-08 09:44:27,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2223#true} is VALID [2022-04-08 09:44:27,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2246#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:27,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2246#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:27,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {2250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2254#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:44:27,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2258#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-08 09:44:27,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {2258#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2262#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-08 09:44:27,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2262#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2266#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-08 09:44:27,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2266#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2270#(and (= (+ main_~sum~0 (- 6)) 0) (= main_~i~0 4))} is VALID [2022-04-08 09:44:27,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2270#(and (= (+ main_~sum~0 (- 6)) 0) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2274#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 0) (= main_~i~0 4))} is VALID [2022-04-08 09:44:27,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2274#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2278#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:44:27,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2282#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-08 09:44:27,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {2282#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2286#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:44:27,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {2286#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2290#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:44:27,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {2290#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2294#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:44:27,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {2294#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2298#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:44:27,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {2298#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2302#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} is VALID [2022-04-08 09:44:27,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {2302#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2306#(and (<= main_~i~0 main_~n~0) (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} is VALID [2022-04-08 09:44:27,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {2306#(and (<= main_~i~0 main_~n~0) (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2310#(and (= (+ main_~sum~0 (- 8)) 28) (<= main_~i~0 9) (<= 8 main_~n~0))} is VALID [2022-04-08 09:44:27,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#(and (= (+ main_~sum~0 (- 8)) 28) (<= main_~i~0 9) (<= 8 main_~n~0))} assume !(~i~0 <= ~n~0); {2314#(and (= (+ main_~sum~0 (- 8)) 28) (< main_~n~0 9) (<= 8 main_~n~0))} is VALID [2022-04-08 09:44:27,185 INFO L272 TraceCheckUtils]: 24: Hoare triple {2314#(and (= (+ main_~sum~0 (- 8)) 28) (< main_~n~0 9) (<= 8 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:27,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:27,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2224#false} is VALID [2022-04-08 09:44:27,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-08 09:44:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:27,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:28,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2022-04-08 09:44:28,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2224#false} is VALID [2022-04-08 09:44:28,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:28,958 INFO L272 TraceCheckUtils]: 24: Hoare triple {2338#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:28,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {2338#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:28,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {2346#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2342#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:28,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2346#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:28,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:28,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:28,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:28,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:28,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:28,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:28,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:29,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:29,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2354#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:29,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2350#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:29,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {2223#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret3 := main(); {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #55#return; {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#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(9, 2); {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2022-04-08 09:44:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 09:44:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:29,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429433417] [2022-04-08 09:44:29,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:29,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455127903] [2022-04-08 09:44:29,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455127903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:29,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 27 [2022-04-08 09:44:29,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:29,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [80485321] [2022-04-08 09:44:29,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [80485321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:29,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 09:44:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97050214] [2022-04-08 09:44:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 09:44:29,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:29,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,023 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-08 09:44:29,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 09:44:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 09:44:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:44:29,024 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:29,574 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 09:44:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 09:44:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 09:44:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 09:44:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 09:44:29,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-08 09:44:29,597 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-08 09:44:29,599 INFO L225 Difference]: With dead ends: 36 [2022-04-08 09:44:29,599 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:44:29,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:44:29,601 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:29,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:44:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:44:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 09:44:29,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:29,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,626 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,627 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:29,627 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:44:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:44:29,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:29,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:29,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 09:44:29,628 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 09:44:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:29,631 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:44:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:44:29,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:29,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:29,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:29,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 09:44:29,632 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-08 09:44:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:29,632 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 09:44:29,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:29,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 09:44:29,661 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-08 09:44:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:44:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:44:29,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:29,664 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:29,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 09:44:29,879 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-08 09:44:29,879 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 17 times [2022-04-08 09:44:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528720256] [2022-04-08 09:44:29,883 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:29,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 18 times [2022-04-08 09:44:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:29,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583552520] [2022-04-08 09:44:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:29,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:29,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155721735] [2022-04-08 09:44:29,910 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:44:29,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:29,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:29,915 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-08 09:44:29,917 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-08 09:44:29,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 09:44:29,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 09:44:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:29,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:30,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2022-04-08 09:44:30,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {2617#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(9, 2); {2617#true} is VALID [2022-04-08 09:44:30,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2022-04-08 09:44:30,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #55#return; {2617#true} is VALID [2022-04-08 09:44:30,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret3 := main(); {2617#true} is VALID [2022-04-08 09:44:30,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2617#true} is VALID [2022-04-08 09:44:30,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2640#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:30,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2644#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:30,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {2644#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2648#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:44:30,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2652#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:30,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {2652#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2656#(and (= (+ (- 2) main_~i~0) 1) (= (+ (- 2) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:44:30,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {2656#(and (= (+ (- 2) main_~i~0) 1) (= (+ (- 2) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2660#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:44:30,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {2660#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2664#(and (= (+ main_~i~0 (- 3)) 1) (= (+ main_~i~0 (- 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:44:30,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {2664#(and (= (+ main_~i~0 (- 3)) 1) (= (+ main_~i~0 (- 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2668#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-08 09:44:30,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2672#(and (= (+ (- 10) (* main_~i~0 4)) main_~sum~0) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-08 09:44:30,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#(and (= (+ (- 10) (* main_~i~0 4)) main_~sum~0) (= (+ main_~i~0 (- 4)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2676#(and (= (+ (- 10) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-08 09:44:30,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {2676#(and (= (+ (- 10) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ main_~i~0 (- 4)) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2680#(and (= (+ main_~i~0 (- 5)) 1) (= (+ (- 14) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:44:30,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {2680#(and (= (+ main_~i~0 (- 5)) 1) (= (+ (- 14) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2684#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 15))) (= (+ main_~i~0 (- 5)) 1))} is VALID [2022-04-08 09:44:30,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2684#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 15))) (= (+ main_~i~0 (- 5)) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2688#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:44:30,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {2688#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2692#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:44:30,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {2692#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2696#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-08 09:44:30,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {2696#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2700#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-08 09:44:30,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {2700#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2704#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:44:30,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2704#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2708#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:44:30,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2708#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2712#(and (<= 9 main_~n~0) (<= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:44:30,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {2712#(and (<= 9 main_~n~0) (<= main_~i~0 10) (= main_~sum~0 45))} assume !(~i~0 <= ~n~0); {2716#(and (<= 9 main_~n~0) (< main_~n~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:44:30,438 INFO L272 TraceCheckUtils]: 26: Hoare triple {2716#(and (<= 9 main_~n~0) (< main_~n~0 10) (= main_~sum~0 45))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:30,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:30,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2618#false} is VALID [2022-04-08 09:44:30,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2022-04-08 09:44:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:30,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:33,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2022-04-08 09:44:33,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2618#false} is VALID [2022-04-08 09:44:33,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:33,029 INFO L272 TraceCheckUtils]: 26: Hoare triple {2740#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:33,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {2744#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {2740#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:33,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2748#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2744#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:33,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2748#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:33,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2756#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:33,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2752#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:33,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret3 := main(); {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #55#return; {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2617#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(9, 2); {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2022-04-08 09:44:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 09:44:33,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:33,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583552520] [2022-04-08 09:44:33,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155721735] [2022-04-08 09:44:33,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155721735] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:33,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:33,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9] total 29 [2022-04-08 09:44:33,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:33,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528720256] [2022-04-08 09:44:33,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528720256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:33,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:33,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 09:44:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185920535] [2022-04-08 09:44:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:44:33,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:33,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,108 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-08 09:44:33,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 09:44:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 09:44:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:44:33,110 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:33,743 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 09:44:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 09:44:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:44:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-08 09:44:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-08 09:44:33,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-08 09:44:33,798 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-08 09:44:33,799 INFO L225 Difference]: With dead ends: 38 [2022-04-08 09:44:33,799 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 09:44:33,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:44:33,803 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:33,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 160 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:44:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 09:44:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 09:44:33,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:33,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,818 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,819 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:33,820 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:44:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:44:33,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:33,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-08 09:44:33,820 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-08 09:44:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:33,821 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:44:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:44:33,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:33,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:33,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:33,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-08 09:44:33,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-08 09:44:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:33,823 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-08 09:44:33,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:33,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-08 09:44:33,842 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-08 09:44:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:44:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:44:33,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:33,843 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:33,860 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-08 09:44:34,060 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-08 09:44:34,060 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash 421891777, now seen corresponding path program 19 times [2022-04-08 09:44:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383513464] [2022-04-08 09:44:34,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:34,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 421891777, now seen corresponding path program 20 times [2022-04-08 09:44:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182270960] [2022-04-08 09:44:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:34,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:34,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008178530] [2022-04-08 09:44:34,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:34,077 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-08 09:44:34,078 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-08 09:44:34,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:34,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:34,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 09:44:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:34,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:34,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {3037#true} call ULTIMATE.init(); {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {3037#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(9, 2); {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {3037#true} assume true; {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3037#true} {3037#true} #55#return; {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {3037#true} call #t~ret3 := main(); {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {3037#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3037#true} is VALID [2022-04-08 09:44:34,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {3037#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3060#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:34,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {3060#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:34,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {3064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3068#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:34,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3072#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:34,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {3072#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3076#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-08 09:44:34,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {3076#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3080#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-08 09:44:34,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {3080#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3084#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:34,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {3084#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:34,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {3088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3092#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:44:34,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {3092#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3096#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:44:34,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3096#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3100#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-08 09:44:34,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {3100#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 3 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-08 09:44:34,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {3104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 3 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3108#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:44:34,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {3108#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3112#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-08 09:44:34,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {3112#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* main_~i~0 2) 1) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3116#(and (= (+ (- 1) (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 4)) 4))} is VALID [2022-04-08 09:44:34,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#(and (= (+ (- 1) (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 4)) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3120#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} is VALID [2022-04-08 09:44:34,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3120#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3124#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:44:34,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {3124#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3128#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} is VALID [2022-04-08 09:44:34,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {3128#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3132#(and (= (+ (- 1) main_~i~0) 9) (= 36 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:44:34,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {3132#(and (= (+ (- 1) main_~i~0) 9) (= 36 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3136#(and (= (+ (- 1) main_~i~0) 9) (<= main_~i~0 main_~n~0) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 36))} is VALID [2022-04-08 09:44:34,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(and (= (+ (- 1) main_~i~0) 9) (<= main_~i~0 main_~n~0) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 36))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3140#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (<= main_~i~0 11))} is VALID [2022-04-08 09:44:34,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {3140#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (<= main_~i~0 11))} assume !(~i~0 <= ~n~0); {3144#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (< main_~n~0 11))} is VALID [2022-04-08 09:44:34,639 INFO L272 TraceCheckUtils]: 28: Hoare triple {3144#(and (= (+ main_~sum~0 (- 19)) 36) (<= 10 main_~n~0) (< main_~n~0 11))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:34,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:34,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3038#false} is VALID [2022-04-08 09:44:34,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#false} assume !false; {3038#false} is VALID [2022-04-08 09:44:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:34,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:37,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#false} assume !false; {3038#false} is VALID [2022-04-08 09:44:37,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3038#false} is VALID [2022-04-08 09:44:37,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:37,642 INFO L272 TraceCheckUtils]: 28: Hoare triple {3168#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:37,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {3172#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {3168#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:37,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {3176#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3172#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:37,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3176#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:37,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3184#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:37,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {3037#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3180#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:37,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {3037#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {3037#true} call #t~ret3 := main(); {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3037#true} {3037#true} #55#return; {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {3037#true} assume true; {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {3037#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(9, 2); {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {3037#true} call ULTIMATE.init(); {3037#true} is VALID [2022-04-08 09:44:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 09:44:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:37,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182270960] [2022-04-08 09:44:37,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008178530] [2022-04-08 09:44:37,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008178530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:37,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:37,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 31 [2022-04-08 09:44:37,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383513464] [2022-04-08 09:44:37,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383513464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:37,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:37,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 09:44:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513205700] [2022-04-08 09:44:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 09:44:37,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:37,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:37,735 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-08 09:44:37,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 09:44:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 09:44:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:44:37,736 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:38,582 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 09:44:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 09:44:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 09:44:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 09:44:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 09:44:38,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-08 09:44:38,617 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-08 09:44:38,619 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:44:38,619 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:44:38,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:44:38,620 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:38,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 09:44:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:44:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 09:44:38,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:38,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,645 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,646 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:38,646 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:44:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:44:38,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:38,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:38,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 09:44:38,647 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 09:44:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:38,647 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:44:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:44:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:38,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:38,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:38,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-08 09:44:38,648 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-08 09:44:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:38,648 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-08 09:44:38,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:38,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-08 09:44:38,672 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-08 09:44:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:44:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 09:44:38,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:38,673 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:38,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 09:44:38,883 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-08 09:44:38,883 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 21 times [2022-04-08 09:44:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:38,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [316794470] [2022-04-08 09:44:38,887 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:38,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 22 times [2022-04-08 09:44:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171567763] [2022-04-08 09:44:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:38,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911342253] [2022-04-08 09:44:38,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:44:38,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:38,923 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-08 09:44:38,923 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-08 09:44:38,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:44:38,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:38,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 09:44:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:38,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:39,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {3483#true} call ULTIMATE.init(); {3483#true} is VALID [2022-04-08 09:44:39,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#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(9, 2); {3483#true} is VALID [2022-04-08 09:44:39,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {3483#true} assume true; {3483#true} is VALID [2022-04-08 09:44:39,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3483#true} {3483#true} #55#return; {3483#true} is VALID [2022-04-08 09:44:39,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {3483#true} call #t~ret3 := main(); {3483#true} is VALID [2022-04-08 09:44:39,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3483#true} is VALID [2022-04-08 09:44:39,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3506#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:39,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3510#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:39,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3514#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:44:39,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {3514#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3518#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:39,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {3518#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3522#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-08 09:44:39,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {3522#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3526#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-08 09:44:39,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {3526#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3530#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:39,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3534#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:44:39,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {3534#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3538#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:44:39,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {3538#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3542#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 6) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:44:39,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 6) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3546#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-08 09:44:39,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {3546#(and (= 6 (+ (- 9) main_~sum~0)) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3550#(and (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} is VALID [2022-04-08 09:44:39,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {3550#(and (= 6 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3554#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:44:39,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {3554#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3558#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:44:39,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {3558#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3562#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:39,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {3562#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3566#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-08 09:44:39,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {3566#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3570#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:44:39,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {3570#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3574#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} is VALID [2022-04-08 09:44:39,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 36) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3578#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-08 09:44:39,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3582#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-08 09:44:39,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {3582#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3586#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-08 09:44:39,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {3586#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3590#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:44:39,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {3590#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3594#(and (= 66 main_~sum~0) (<= 11 main_~n~0) (<= main_~i~0 12))} is VALID [2022-04-08 09:44:39,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {3594#(and (= 66 main_~sum~0) (<= 11 main_~n~0) (<= main_~i~0 12))} assume !(~i~0 <= ~n~0); {3598#(and (< main_~n~0 12) (= 66 main_~sum~0) (<= 11 main_~n~0))} is VALID [2022-04-08 09:44:39,515 INFO L272 TraceCheckUtils]: 30: Hoare triple {3598#(and (< main_~n~0 12) (= 66 main_~sum~0) (<= 11 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:39,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:39,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {3606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3484#false} is VALID [2022-04-08 09:44:39,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {3484#false} assume !false; {3484#false} is VALID [2022-04-08 09:44:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:39,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:42,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {3484#false} assume !false; {3484#false} is VALID [2022-04-08 09:44:42,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {3606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3484#false} is VALID [2022-04-08 09:44:42,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:42,037 INFO L272 TraceCheckUtils]: 30: Hoare triple {3622#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:42,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {3626#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {3622#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:42,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {3630#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3626#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:42,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3630#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:42,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3638#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:42,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3634#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:42,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3483#true} is VALID [2022-04-08 09:44:42,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {3483#true} call #t~ret3 := main(); {3483#true} is VALID [2022-04-08 09:44:42,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3483#true} {3483#true} #55#return; {3483#true} is VALID [2022-04-08 09:44:42,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {3483#true} assume true; {3483#true} is VALID [2022-04-08 09:44:42,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#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(9, 2); {3483#true} is VALID [2022-04-08 09:44:42,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {3483#true} call ULTIMATE.init(); {3483#true} is VALID [2022-04-08 09:44:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 09:44:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171567763] [2022-04-08 09:44:42,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911342253] [2022-04-08 09:44:42,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911342253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:42,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:42,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 33 [2022-04-08 09:44:42,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:42,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [316794470] [2022-04-08 09:44:42,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [316794470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:42,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:42,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 09:44:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600069443] [2022-04-08 09:44:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:44:42,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:42,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:42,140 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-08 09:44:42,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 09:44:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 09:44:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:44:42,141 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:43,142 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 09:44:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 09:44:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:44:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-08 09:44:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-08 09:44:43,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-08 09:44:43,178 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-08 09:44:43,178 INFO L225 Difference]: With dead ends: 42 [2022-04-08 09:44:43,178 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 09:44:43,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 09:44:43,179 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:43,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 09:44:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 09:44:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 09:44:43,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:43,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,201 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,201 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:43,202 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 09:44:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:44:43,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:43,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:43,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 09:44:43,203 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 09:44:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:43,204 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 09:44:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:44:43,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:43,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:43,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:43,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-08 09:44:43,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-08 09:44:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:43,205 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-08 09:44:43,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:43,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-08 09:44:43,240 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-08 09:44:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:44:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 09:44:43,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:43,240 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:43,259 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-08 09:44:43,441 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-08 09:44:43,441 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1369668995, now seen corresponding path program 23 times [2022-04-08 09:44:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:43,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004666568] [2022-04-08 09:44:43,444 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:43,444 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1369668995, now seen corresponding path program 24 times [2022-04-08 09:44:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912937640] [2022-04-08 09:44:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:43,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312393004] [2022-04-08 09:44:43,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:44:43,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:43,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:43,468 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-08 09:44:43,470 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-08 09:44:43,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 09:44:43,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:43,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 09:44:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:43,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:43,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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(9, 2); {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #55#return; {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret3 := main(); {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2022-04-08 09:44:43,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {3955#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3978#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:43,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {3978#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3982#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:43,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {3982#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3986#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:44:43,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {3986#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3990#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:43,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3994#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:44:43,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {3994#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3998#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:44:43,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4002#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:43,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {4002#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4006#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-08 09:44:43,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {4006#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4010#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:44:43,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4014#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-08 09:44:43,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {4014#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4018#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:44:43,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {4018#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4022#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:44:43,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {4022#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4026#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:44:43,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {4026#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4030#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:44:43,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {4030#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4034#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-08 09:44:43,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {4034#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4038#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-08 09:44:43,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {4038#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4042#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:43,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {4042#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4046#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:44:43,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {4046#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4050#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:44:43,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {4050#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4054#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:44:43,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {4054#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4058#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:43,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {4058#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:43,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {4062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4066#(and (= (+ (- 1) main_~i~0) 11) (= 55 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:44:43,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {4066#(and (= (+ (- 1) main_~i~0) 11) (= 55 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4070#(and (= (+ (- 1) main_~i~0) 11) (<= main_~i~0 main_~n~0) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-08 09:44:43,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {4070#(and (= (+ (- 1) main_~i~0) 11) (<= main_~i~0 main_~n~0) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4074#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2022-04-08 09:44:43,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {4074#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} assume !(~i~0 <= ~n~0); {4078#(and (< main_~n~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2022-04-08 09:44:43,955 INFO L272 TraceCheckUtils]: 32: Hoare triple {4078#(and (< main_~n~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:43,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:43,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3956#false} is VALID [2022-04-08 09:44:43,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-08 09:44:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:43,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:47,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-08 09:44:47,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3956#false} is VALID [2022-04-08 09:44:47,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:47,248 INFO L272 TraceCheckUtils]: 32: Hoare triple {4102#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:47,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {4106#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {4102#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:47,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {4110#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4106#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:47,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4110#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:47,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4118#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:47,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {3955#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4114#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:47,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2022-04-08 09:44:47,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret3 := main(); {3955#true} is VALID [2022-04-08 09:44:47,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #55#return; {3955#true} is VALID [2022-04-08 09:44:47,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-08 09:44:47,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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(9, 2); {3955#true} is VALID [2022-04-08 09:44:47,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-08 09:44:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 09:44:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912937640] [2022-04-08 09:44:47,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312393004] [2022-04-08 09:44:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312393004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:47,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9] total 35 [2022-04-08 09:44:47,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004666568] [2022-04-08 09:44:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004666568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:47,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 09:44:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906400541] [2022-04-08 09:44:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 09:44:47,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:47,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:47,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-08 09:44:47,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 09:44:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 09:44:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 09:44:47,366 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:48,598 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 09:44:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 09:44:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 09:44:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-08 09:44:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-08 09:44:48,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-08 09:44:48,638 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-08 09:44:48,638 INFO L225 Difference]: With dead ends: 44 [2022-04-08 09:44:48,638 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 09:44:48,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=1220, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 09:44:48,639 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:48,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 09:44:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 09:44:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 09:44:48,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:48,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,660 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,660 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:48,661 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 09:44:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:44:48,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:48,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:48,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 09:44:48,661 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 09:44:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:48,662 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 09:44:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:44:48,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:48,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:48,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:48,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-08 09:44:48,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-08 09:44:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:48,663 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-08 09:44:48,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:48,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-08 09:44:48,700 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-08 09:44:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:44:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:44:48,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:48,701 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:48,717 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-08 09:44:48,901 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-08 09:44:48,902 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 25 times [2022-04-08 09:44:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:48,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841088414] [2022-04-08 09:44:48,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:48,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 26 times [2022-04-08 09:44:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029913015] [2022-04-08 09:44:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:48,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:48,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172505799] [2022-04-08 09:44:48,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:48,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:48,922 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-08 09:44:48,924 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-08 09:44:48,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:48,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:48,964 WARN L261 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 09:44:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:48,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:49,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {4453#true} call ULTIMATE.init(); {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#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(9, 2); {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {4453#true} assume true; {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4453#true} {4453#true} #55#return; {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {4453#true} call #t~ret3 := main(); {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {4453#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4453#true} is VALID [2022-04-08 09:44:49,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {4453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4476#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:49,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {4476#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4480#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:49,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {4480#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:49,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {4484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4488#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:44:49,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {4488#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4492#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-08 09:44:49,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {4492#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4496#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* main_~i~0 (- 3))) 0))} is VALID [2022-04-08 09:44:49,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* main_~i~0 (- 3))) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4500#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) 0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-08 09:44:49,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {4500#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) 0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4504#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-08 09:44:49,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {4504#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4508#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:44:49,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {4508#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4512#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:44:49,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {4512#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4516#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-08 09:44:49,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {4516#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4520#(and (= main_~i~0 6) (= (+ (* (- 1) main_~i~0) main_~sum~0) 15))} is VALID [2022-04-08 09:44:49,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {4520#(and (= main_~i~0 6) (= (+ (* (- 1) main_~i~0) main_~sum~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4524#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} is VALID [2022-04-08 09:44:49,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4528#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} is VALID [2022-04-08 09:44:49,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4532#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-08 09:44:49,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {4532#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4536#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-08 09:44:49,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {4536#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 15) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4540#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:49,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {4540#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4544#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:44:49,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {4544#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4548#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-08 09:44:49,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {4548#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4552#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:44:49,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {4552#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4556#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:49,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {4556#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4560#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:49,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {4560#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4564#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:44:49,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {4564#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4568#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-08 09:44:49,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {4568#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4572#(and (= (+ (- 2) main_~i~0) 11) (= main_~sum~0 (+ 52 (* main_~i~0 2))))} is VALID [2022-04-08 09:44:49,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {4572#(and (= (+ (- 2) main_~i~0) 11) (= main_~sum~0 (+ 52 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4576#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 52 (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 2) main_~i~0) 11))} is VALID [2022-04-08 09:44:49,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {4576#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 52 (* main_~i~0 2))) (<= main_~i~0 main_~n~0) (= (+ (- 2) main_~i~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4580#(and (<= main_~i~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} is VALID [2022-04-08 09:44:49,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {4580#(and (<= main_~i~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} assume !(~i~0 <= ~n~0); {4584#(and (< main_~n~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} is VALID [2022-04-08 09:44:49,699 INFO L272 TraceCheckUtils]: 34: Hoare triple {4584#(and (< main_~n~0 14) (= (+ (- 13) main_~sum~0) 78) (<= 13 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:49,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:49,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {4592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4454#false} is VALID [2022-04-08 09:44:49,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {4454#false} assume !false; {4454#false} is VALID [2022-04-08 09:44:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:49,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:53,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {4454#false} assume !false; {4454#false} is VALID [2022-04-08 09:44:53,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {4592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4454#false} is VALID [2022-04-08 09:44:53,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:53,614 INFO L272 TraceCheckUtils]: 34: Hoare triple {4608#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:53,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {4612#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {4608#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:44:53,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {4616#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4612#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:53,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4616#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:44:53,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4624#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:44:53,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {4453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4620#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:44:53,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {4453#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4453#true} is VALID [2022-04-08 09:44:53,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {4453#true} call #t~ret3 := main(); {4453#true} is VALID [2022-04-08 09:44:53,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4453#true} {4453#true} #55#return; {4453#true} is VALID [2022-04-08 09:44:53,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {4453#true} assume true; {4453#true} is VALID [2022-04-08 09:44:53,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {4453#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(9, 2); {4453#true} is VALID [2022-04-08 09:44:53,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {4453#true} call ULTIMATE.init(); {4453#true} is VALID [2022-04-08 09:44:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 09:44:53,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:53,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029913015] [2022-04-08 09:44:53,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:53,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172505799] [2022-04-08 09:44:53,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172505799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:53,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:53,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9] total 37 [2022-04-08 09:44:53,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841088414] [2022-04-08 09:44:53,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841088414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:53,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:53,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 09:44:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55885596] [2022-04-08 09:44:53,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:53,707 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:44:53,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:53,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:53,738 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-08 09:44:53,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 09:44:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 09:44:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 09:44:53,739 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:55,220 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:44:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 09:44:55,220 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:44:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 09:44:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 09:44:55,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-08 09:44:55,259 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-08 09:44:55,260 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:44:55,260 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 09:44:55,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 09:44:55,261 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:55,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 09:44:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 09:44:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 09:44:55,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:55,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,283 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,283 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:55,284 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 09:44:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:44:55,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:55,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:55,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 09:44:55,285 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 09:44:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:55,285 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 09:44:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:44:55,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:55,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:55,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:55,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-08 09:44:55,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-08 09:44:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:55,287 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-08 09:44:55,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-08 09:44:55,328 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-08 09:44:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:44:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 09:44:55,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:55,329 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:55,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 09:44:55,529 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-08 09:44:55,529 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash 591083577, now seen corresponding path program 27 times [2022-04-08 09:44:55,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:55,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516882933] [2022-04-08 09:44:55,532 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:44:55,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:44:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 591083577, now seen corresponding path program 28 times [2022-04-08 09:44:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:55,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123323090] [2022-04-08 09:44:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:55,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6168925] [2022-04-08 09:44:55,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:44:55,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:55,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:55,549 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-08 09:44:55,552 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-08 09:44:55,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:44:55,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:55,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 09:44:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:55,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:56,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {4977#true} call ULTIMATE.init(); {4977#true} is VALID [2022-04-08 09:44:56,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {4977#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(9, 2); {4977#true} is VALID [2022-04-08 09:44:56,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {4977#true} assume true; {4977#true} is VALID [2022-04-08 09:44:56,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4977#true} {4977#true} #55#return; {4977#true} is VALID [2022-04-08 09:44:56,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {4977#true} call #t~ret3 := main(); {4977#true} is VALID [2022-04-08 09:44:56,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {4977#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4977#true} is VALID [2022-04-08 09:44:56,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5000#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:56,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5004#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:44:56,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {5004#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5008#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:44:56,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {5008#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5012#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:44:56,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {5012#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5016#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-08 09:44:56,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {5016#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:44:56,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {5020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5024#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:56,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {5024#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5028#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:44:56,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {5028#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5032#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:44:56,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5036#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:44:56,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {5036#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5040#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} is VALID [2022-04-08 09:44:56,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {5040#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5044#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:44:56,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {5044#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5048#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:44:56,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {5048#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5052#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:44:56,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {5052#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5056#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:56,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {5056#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5060#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} is VALID [2022-04-08 09:44:56,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {5060#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:44:56,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {5064#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5068#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:44:56,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {5068#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5072#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:44:56,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {5072#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5076#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:44:56,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {5076#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5080#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:56,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5084#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:44:56,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {5084#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5088#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:44:56,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {5088#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5092#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:44:56,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {5092#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5096#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:44:56,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {5096#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5100#(and (= 12 (+ (* (- 1) main_~i~0) main_~sum~0 (- 66))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 65))))} is VALID [2022-04-08 09:44:56,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {5100#(and (= 12 (+ (* (- 1) main_~i~0) main_~sum~0 (- 66))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 65))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5104#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:44:56,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5108#(and (= main_~sum~0 (+ 91 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 14))} is VALID [2022-04-08 09:44:56,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {5108#(and (= main_~sum~0 (+ 91 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5112#(and (<= (+ main_~i~0 90) main_~sum~0) (= 14 (+ main_~sum~0 (- 91))) (<= main_~sum~0 (+ 91 main_~n~0)))} is VALID [2022-04-08 09:44:56,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {5112#(and (<= (+ main_~i~0 90) main_~sum~0) (= 14 (+ main_~sum~0 (- 91))) (<= main_~sum~0 (+ 91 main_~n~0)))} assume !(~i~0 <= ~n~0); {5116#(and (= 14 (+ main_~sum~0 (- 91))) (< (+ main_~n~0 90) main_~sum~0) (<= main_~sum~0 (+ 91 main_~n~0)))} is VALID [2022-04-08 09:44:56,384 INFO L272 TraceCheckUtils]: 36: Hoare triple {5116#(and (= 14 (+ main_~sum~0 (- 91))) (< (+ main_~n~0 90) main_~sum~0) (<= main_~sum~0 (+ 91 main_~n~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:44:56,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5124#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:44:56,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {5124#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4978#false} is VALID [2022-04-08 09:44:56,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {4978#false} assume !false; {4978#false} is VALID [2022-04-08 09:44:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:56,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:00,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {4978#false} assume !false; {4978#false} is VALID [2022-04-08 09:45:00,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {5124#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4978#false} is VALID [2022-04-08 09:45:00,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5124#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:00,251 INFO L272 TraceCheckUtils]: 36: Hoare triple {5140#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5120#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:00,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {5144#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {5140#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:00,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {5148#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5144#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:00,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5148#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:00,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5156#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:00,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5152#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:00,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {4977#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4977#true} is VALID [2022-04-08 09:45:00,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {4977#true} call #t~ret3 := main(); {4977#true} is VALID [2022-04-08 09:45:00,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4977#true} {4977#true} #55#return; {4977#true} is VALID [2022-04-08 09:45:00,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {4977#true} assume true; {4977#true} is VALID [2022-04-08 09:45:00,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {4977#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(9, 2); {4977#true} is VALID [2022-04-08 09:45:00,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {4977#true} call ULTIMATE.init(); {4977#true} is VALID [2022-04-08 09:45:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-08 09:45:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123323090] [2022-04-08 09:45:00,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6168925] [2022-04-08 09:45:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6168925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:00,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:00,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 9] total 39 [2022-04-08 09:45:00,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:00,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516882933] [2022-04-08 09:45:00,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516882933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:00,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:00,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 09:45:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040266766] [2022-04-08 09:45:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:00,353 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 09:45:00,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:00,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:00,379 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-08 09:45:00,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 09:45:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 09:45:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 09:45:00,381 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:02,207 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 09:45:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 09:45:02,208 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 09:45:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-08 09:45:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-08 09:45:02,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-08 09:45:02,250 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-08 09:45:02,251 INFO L225 Difference]: With dead ends: 48 [2022-04-08 09:45:02,251 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 09:45:02,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 09:45:02,254 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:02,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 237 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 09:45:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 09:45:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 09:45:02,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:02,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,273 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,274 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:02,274 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 09:45:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:45:02,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:02,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:02,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 09:45:02,275 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 09:45:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:02,276 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 09:45:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:45:02,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:02,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:02,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:02,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-08 09:45:02,277 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-08 09:45:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:02,277 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-08 09:45:02,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:02,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-08 09:45:02,325 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-08 09:45:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:45:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 09:45:02,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:02,325 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:02,342 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-08 09:45:02,526 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-08 09:45:02,526 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 29 times [2022-04-08 09:45:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:02,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140187407] [2022-04-08 09:45:02,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:02,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 30 times [2022-04-08 09:45:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:02,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608654722] [2022-04-08 09:45:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:02,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:02,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6080501] [2022-04-08 09:45:02,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:45:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:02,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:02,558 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-08 09:45:02,559 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-08 09:45:02,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 09:45:02,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:02,603 WARN L261 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 09:45:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:02,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:03,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {5527#true} call ULTIMATE.init(); {5527#true} is VALID [2022-04-08 09:45:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {5527#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(9, 2); {5527#true} is VALID [2022-04-08 09:45:03,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {5527#true} assume true; {5527#true} is VALID [2022-04-08 09:45:03,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5527#true} {5527#true} #55#return; {5527#true} is VALID [2022-04-08 09:45:03,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {5527#true} call #t~ret3 := main(); {5527#true} is VALID [2022-04-08 09:45:03,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {5527#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5527#true} is VALID [2022-04-08 09:45:03,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5550#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:03,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5554#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:03,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {5554#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5558#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:45:03,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {5558#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5562#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:45:03,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {5562#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5566#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-08 09:45:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {5566#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5570#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} is VALID [2022-04-08 09:45:03,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {5570#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5574#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:45:03,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5578#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:45:03,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5582#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:45:03,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5586#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:45:03,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {5586#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5590#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} is VALID [2022-04-08 09:45:03,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5594#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} is VALID [2022-04-08 09:45:03,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {5594#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5598#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:45:03,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5602#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:45:03,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {5602#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5606#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:03,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {5606#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5610#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:03,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {5610#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5614#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:45:03,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {5614#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5618#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:45:03,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {5618#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5622#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:45:03,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {5622#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5626#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:03,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {5626#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5630#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:03,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {5630#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5634#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:03,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {5634#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5638#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:45:03,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {5638#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5642#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:45:03,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {5642#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5646#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:45:03,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {5646#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5650#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:45:03,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {5650#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5654#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-08 09:45:03,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {5654#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5658#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:45:03,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {5658#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5662#(and (= main_~sum~0 (+ main_~i~0 90)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:45:03,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(and (= main_~sum~0 (+ main_~i~0 90)) (= (+ (- 1) main_~i~0) 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5666#(and (<= main_~i~0 main_~n~0) (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:45:03,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {5666#(and (<= main_~i~0 main_~n~0) (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5670#(and (<= main_~i~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} is VALID [2022-04-08 09:45:03,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {5670#(and (<= main_~i~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} assume !(~i~0 <= ~n~0); {5674#(and (< main_~n~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} is VALID [2022-04-08 09:45:03,279 INFO L272 TraceCheckUtils]: 38: Hoare triple {5674#(and (< main_~n~0 16) (<= 15 main_~n~0) (= main_~sum~0 120))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:03,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:03,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {5682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5528#false} is VALID [2022-04-08 09:45:03,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {5528#false} assume !false; {5528#false} is VALID [2022-04-08 09:45:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:03,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:08,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {5528#false} assume !false; {5528#false} is VALID [2022-04-08 09:45:08,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {5682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5528#false} is VALID [2022-04-08 09:45:08,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:08,365 INFO L272 TraceCheckUtils]: 38: Hoare triple {5698#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:08,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {5702#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {5698#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:08,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {5706#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5702#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:08,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5706#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:08,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5714#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:08,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5710#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:08,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {5527#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5527#true} is VALID [2022-04-08 09:45:08,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {5527#true} call #t~ret3 := main(); {5527#true} is VALID [2022-04-08 09:45:08,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5527#true} {5527#true} #55#return; {5527#true} is VALID [2022-04-08 09:45:08,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {5527#true} assume true; {5527#true} is VALID [2022-04-08 09:45:08,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {5527#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(9, 2); {5527#true} is VALID [2022-04-08 09:45:08,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {5527#true} call ULTIMATE.init(); {5527#true} is VALID [2022-04-08 09:45:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 09:45:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:08,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608654722] [2022-04-08 09:45:08,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:08,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6080501] [2022-04-08 09:45:08,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6080501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:08,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:08,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 9] total 41 [2022-04-08 09:45:08,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:08,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140187407] [2022-04-08 09:45:08,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140187407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:08,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:08,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 09:45:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014656416] [2022-04-08 09:45:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:45:08,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:08,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:08,780 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-08 09:45:08,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 09:45:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 09:45:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 09:45:08,781 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:10,731 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 09:45:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 09:45:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:45:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-08 09:45:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-08 09:45:10,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-08 09:45:10,785 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-08 09:45:10,786 INFO L225 Difference]: With dead ends: 50 [2022-04-08 09:45:10,786 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 09:45:10,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:45:10,787 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:10,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 09:45:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 09:45:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 09:45:10,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:10,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,823 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,823 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:10,825 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 09:45:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:45:10,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:10,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:10,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 09:45:10,826 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 09:45:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:10,828 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 09:45:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:45:10,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:10,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:10,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:10,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-08 09:45:10,837 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-08 09:45:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:10,838 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-08 09:45:10,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:10,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-08 09:45:10,887 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-08 09:45:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:45:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 09:45:10,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:10,888 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:10,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 09:45:11,088 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-08 09:45:11,088 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -99569675, now seen corresponding path program 31 times [2022-04-08 09:45:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:11,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291712339] [2022-04-08 09:45:11,092 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:11,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -99569675, now seen corresponding path program 32 times [2022-04-08 09:45:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337522435] [2022-04-08 09:45:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:11,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:11,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119052884] [2022-04-08 09:45:11,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:45:11,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:11,135 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-08 09:45:11,175 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-08 09:45:11,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:45:11,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:11,199 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 09:45:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:11,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:11,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2022-04-08 09:45:11,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {6103#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(9, 2); {6103#true} is VALID [2022-04-08 09:45:11,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2022-04-08 09:45:11,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #55#return; {6103#true} is VALID [2022-04-08 09:45:11,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret3 := main(); {6103#true} is VALID [2022-04-08 09:45:11,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {6103#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6103#true} is VALID [2022-04-08 09:45:11,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {6103#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6126#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:11,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {6126#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6130#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:11,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {6130#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6134#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:45:11,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {6134#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6138#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:45:11,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {6138#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 0) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6142#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} is VALID [2022-04-08 09:45:11,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {6142#(and (= (+ (- 2) main_~i~0) 1) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6146#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-08 09:45:11,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {6146#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6150#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:45:11,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {6150#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:45:11,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {6154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6158#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:45:11,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {6158#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6162#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:45:11,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {6162#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6166#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} is VALID [2022-04-08 09:45:11,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6170#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:45:11,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {6170#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6174#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:45:11,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {6174#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6178#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:45:11,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {6178#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6182#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:11,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6186#(and (= 6 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 12 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:11,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {6186#(and (= 6 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 12 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6190#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-08 09:45:11,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {6190#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-08 09:45:11,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {6194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 8)) 28) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6198#(and (= (+ (- 1) main_~i~0) 9) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 7)) 28))} is VALID [2022-04-08 09:45:11,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {6198#(and (= (+ (- 1) main_~i~0) 9) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 7)) 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6202#(and (= (+ (- 1) main_~i~0) 9) (= 28 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:45:11,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {6202#(and (= (+ (- 1) main_~i~0) 9) (= 28 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6206#(and (= (+ main_~sum~0 (- 5) (* (- 2) main_~i~0)) 28) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:11,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {6206#(and (= (+ main_~sum~0 (- 5) (* (- 2) main_~i~0)) 28) (= 9 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6210#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:11,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {6210#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6214#(and (= main_~i~0 12) (= 66 main_~sum~0))} is VALID [2022-04-08 09:45:11,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {6214#(and (= main_~i~0 12) (= 66 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6218#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:45:11,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {6218#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6222#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:45:11,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {6222#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6226#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:45:11,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {6226#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6230#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-08 09:45:11,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {6230#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6234#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:45:11,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {6234#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6238#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:45:11,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {6238#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6242#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:45:11,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {6242#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6246#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:45:11,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {6246#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 88 (* main_~i~0 2))) (= 14 (+ (- 2) main_~i~0)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:45:11,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {6250#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 88 (* main_~i~0 2))) (= 14 (+ (- 2) main_~i~0)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6254#(and (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)) (<= main_~i~0 17))} is VALID [2022-04-08 09:45:11,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {6254#(and (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)) (<= main_~i~0 17))} assume !(~i~0 <= ~n~0); {6258#(and (< main_~n~0 17) (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)))} is VALID [2022-04-08 09:45:11,972 INFO L272 TraceCheckUtils]: 40: Hoare triple {6258#(and (< main_~n~0 17) (<= 16 main_~n~0) (= 120 (+ (- 16) main_~sum~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:11,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:11,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {6266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6104#false} is VALID [2022-04-08 09:45:11,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2022-04-08 09:45:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:11,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:17,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2022-04-08 09:45:17,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {6266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6104#false} is VALID [2022-04-08 09:45:17,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:17,186 INFO L272 TraceCheckUtils]: 40: Hoare triple {6282#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:17,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {6286#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {6282#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:17,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {6290#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6286#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:17,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6290#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:17,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6298#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:17,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {6103#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6294#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:17,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {6103#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret3 := main(); {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #55#return; {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {6103#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(9, 2); {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2022-04-08 09:45:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-08 09:45:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337522435] [2022-04-08 09:45:17,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119052884] [2022-04-08 09:45:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119052884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:17,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 9] total 43 [2022-04-08 09:45:17,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291712339] [2022-04-08 09:45:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291712339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:17,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 09:45:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079845927] [2022-04-08 09:45:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:45:17,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:17,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:17,324 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-08 09:45:17,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 09:45:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 09:45:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1681, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:45:17,325 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:19,172 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 09:45:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 09:45:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:45:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-08 09:45:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-08 09:45:19,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-08 09:45:19,213 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-08 09:45:19,213 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:45:19,214 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 09:45:19,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=136, Invalid=1844, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 09:45:19,214 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:19,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 265 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 09:45:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 09:45:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 09:45:19,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:19,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,240 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,240 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:19,241 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 09:45:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:19,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:19,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:19,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 09:45:19,242 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 09:45:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:19,242 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 09:45:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:19,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:19,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:19,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:19,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-08 09:45:19,243 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-08 09:45:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:19,243 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-08 09:45:19,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:19,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-08 09:45:19,284 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-08 09:45:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 09:45:19,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:19,285 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:19,303 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-08 09:45:19,485 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-08 09:45:19,486 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 33 times [2022-04-08 09:45:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:19,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190097456] [2022-04-08 09:45:19,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:19,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 34 times [2022-04-08 09:45:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:19,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278047136] [2022-04-08 09:45:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:19,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:19,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109611684] [2022-04-08 09:45:19,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:45:19,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:19,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:19,500 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-08 09:45:19,514 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-08 09:45:19,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:45:19,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:19,561 WARN L261 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 09:45:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:19,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:20,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#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(9, 2); {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #55#return; {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret3 := main(); {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {6705#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6705#true} is VALID [2022-04-08 09:45:20,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {6705#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6728#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:20,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {6728#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6732#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:20,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {6732#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6736#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:45:20,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {6736#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6740#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:45:20,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {6740#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6744#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 2)))} is VALID [2022-04-08 09:45:20,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {6744#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 2)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6748#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:45:20,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {6748#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6752#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:45:20,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {6752#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6756#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:45:20,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {6756#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6760#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:45:20,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {6760#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6764#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:45:20,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {6764#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6768#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-08 09:45:20,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {6768#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6772#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:45:20,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {6772#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6776#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:45:20,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {6776#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6780#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:45:20,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {6780#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6784#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:45:20,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {6784#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6788#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:20,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {6788#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6792#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:45:20,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {6792#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6796#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:45:20,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {6796#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6800#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:45:20,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {6800#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6804#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:20,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {6804#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6808#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:20,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {6808#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6812#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:20,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {6812#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 33 (* main_~i~0 2))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6816#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:45:20,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(and (= (+ 31 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6820#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:45:20,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {6820#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6824#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:45:20,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {6824#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6828#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:45:20,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {6828#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6832#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:45:20,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {6832#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6836#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-08 09:45:20,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {6836#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6840#(and (= main_~i~0 15) (= main_~sum~0 105))} is VALID [2022-04-08 09:45:20,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {6840#(and (= main_~i~0 15) (= main_~sum~0 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6844#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-08 09:45:20,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {6844#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6848#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} is VALID [2022-04-08 09:45:20,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {6848#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6852#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} is VALID [2022-04-08 09:45:20,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {6852#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6856#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-08 09:45:20,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {6856#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6860#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-08 09:45:20,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {6860#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6864#(and (<= (+ main_~i~0 135) main_~sum~0) (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17))} is VALID [2022-04-08 09:45:20,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {6864#(and (<= (+ main_~i~0 135) main_~sum~0) (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17))} assume !(~i~0 <= ~n~0); {6868#(and (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17) (< (+ main_~n~0 135) main_~sum~0))} is VALID [2022-04-08 09:45:20,426 INFO L272 TraceCheckUtils]: 42: Hoare triple {6868#(and (<= main_~sum~0 (+ main_~n~0 136)) (= (+ main_~sum~0 (- 136)) 17) (< (+ main_~n~0 135) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:20,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:20,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {6876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6706#false} is VALID [2022-04-08 09:45:20,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2022-04-08 09:45:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:20,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:29,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {6706#false} assume !false; {6706#false} is VALID [2022-04-08 09:45:29,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {6876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6706#false} is VALID [2022-04-08 09:45:29,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:29,121 INFO L272 TraceCheckUtils]: 42: Hoare triple {6892#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:29,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {6896#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {6892#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:29,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {6900#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6896#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:29,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6900#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:29,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6908#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:29,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {6705#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6904#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:29,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {6705#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {6705#true} call #t~ret3 := main(); {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6705#true} {6705#true} #55#return; {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {6705#true} assume true; {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {6705#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(9, 2); {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {6705#true} call ULTIMATE.init(); {6705#true} is VALID [2022-04-08 09:45:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-08 09:45:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:29,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278047136] [2022-04-08 09:45:29,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:29,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109611684] [2022-04-08 09:45:29,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109611684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:29,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:29,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 9] total 45 [2022-04-08 09:45:29,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:29,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190097456] [2022-04-08 09:45:29,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190097456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:29,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:29,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 09:45:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061093264] [2022-04-08 09:45:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 09:45:29,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:29,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:29,316 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-08 09:45:29,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 09:45:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 09:45:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 09:45:29,317 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:31,815 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 09:45:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 09:45:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 09:45:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-08 09:45:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-08 09:45:31,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-08 09:45:31,900 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-08 09:45:31,900 INFO L225 Difference]: With dead ends: 54 [2022-04-08 09:45:31,900 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 09:45:31,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=142, Invalid=2020, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 09:45:31,901 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:31,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 272 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 09:45:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 09:45:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 09:45:31,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:31,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,920 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,920 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:31,920 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 09:45:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:45:31,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:31,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 09:45:31,921 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 09:45:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:31,921 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 09:45:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:45:31,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:31,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:31,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:31,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-08 09:45:31,922 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-08 09:45:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:31,923 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-08 09:45:31,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:31,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-08 09:45:31,976 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-08 09:45:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:45:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 09:45:31,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:31,977 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:32,009 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-08 09:45:32,177 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-08 09:45:32,178 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:32,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -173282895, now seen corresponding path program 35 times [2022-04-08 09:45:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:32,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41128050] [2022-04-08 09:45:32,180 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:32,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash -173282895, now seen corresponding path program 36 times [2022-04-08 09:45:32,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:32,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198560990] [2022-04-08 09:45:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:32,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956252349] [2022-04-08 09:45:32,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:45:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:32,191 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-08 09:45:32,192 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-08 09:45:32,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 09:45:32,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:32,238 WARN L261 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 09:45:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:32,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:33,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {7333#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(9, 2); {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #55#return; {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret3 := main(); {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {7333#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7333#true} is VALID [2022-04-08 09:45:33,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7356#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:33,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {7356#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7360#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:33,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {7360#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7364#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:45:33,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {7364#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7368#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-08 09:45:33,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {7368#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7372#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-08 09:45:33,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {7372#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7376#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-08 09:45:33,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {7376#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7380#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:45:33,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {7380#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7384#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:45:33,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {7384#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7388#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:45:33,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {7388#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7392#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:45:33,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {7392#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7396#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:45:33,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {7396#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7400#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:45:33,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {7400#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7404#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:45:33,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {7404#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7408#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:45:33,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {7408#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7412#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:45:33,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (= 7 (+ main_~sum~0 (- 21))) (= (+ (- 20) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7416#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} is VALID [2022-04-08 09:45:33,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {7416#(and (= main_~i~0 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7420#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:45:33,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {7420#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 19)) (+ (- 1) main_~i~0)) (= 7 (+ (- 20) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7424#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:45:33,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {7424#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7428#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:45:33,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {7428#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7432#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:45:33,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {7432#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7436#(and (= (+ 44 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 10))} is VALID [2022-04-08 09:45:33,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (= (+ 44 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7440#(and (= (+ (- 1) main_~i~0) 10) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 44 main_~i~0)))} is VALID [2022-04-08 09:45:33,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {7440#(and (= (+ (- 1) main_~i~0) 10) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 44 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7444#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-08 09:45:33,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {7444#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7448#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:45:33,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {7448#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7452#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} is VALID [2022-04-08 09:45:33,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {7452#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7456#(and (= (+ (- 1) main_~i~0) 12) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 65)))} is VALID [2022-04-08 09:45:33,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {7456#(and (= (+ (- 1) main_~i~0) 12) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 65)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7460#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:45:33,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {7460#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7464#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:45:33,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {7464#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7468#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:45:33,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {7468#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7472#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-08 09:45:33,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {7472#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7476#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))) (= (+ (- 89) (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:45:33,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))) (= (+ (- 89) (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7480#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:45:33,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {7480#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7484#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2022-04-08 09:45:33,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {7484#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7488#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-08 09:45:33,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7492#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-08 09:45:33,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {7492#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7496#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} is VALID [2022-04-08 09:45:33,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {7496#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7500#(and (<= (+ 152 main_~i~0) main_~sum~0) (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)))} is VALID [2022-04-08 09:45:33,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {7500#(and (<= (+ 152 main_~i~0) main_~sum~0) (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)))} assume !(~i~0 <= ~n~0); {7504#(and (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)) (< (+ 152 main_~n~0) main_~sum~0))} is VALID [2022-04-08 09:45:33,288 INFO L272 TraceCheckUtils]: 44: Hoare triple {7504#(and (= (+ (- 153) main_~sum~0) 18) (<= main_~sum~0 (+ 153 main_~n~0)) (< (+ 152 main_~n~0) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:33,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:33,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {7512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7334#false} is VALID [2022-04-08 09:45:33,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2022-04-08 09:45:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:33,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:42,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2022-04-08 09:45:42,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {7512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7334#false} is VALID [2022-04-08 09:45:42,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:42,222 INFO L272 TraceCheckUtils]: 44: Hoare triple {7528#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:42,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {7532#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {7528#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:42,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {7536#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7532#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:42,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7536#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:42,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7544#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:42,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7540#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:42,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {7333#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7333#true} is VALID [2022-04-08 09:45:42,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret3 := main(); {7333#true} is VALID [2022-04-08 09:45:42,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #55#return; {7333#true} is VALID [2022-04-08 09:45:42,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2022-04-08 09:45:42,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {7333#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(9, 2); {7333#true} is VALID [2022-04-08 09:45:42,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2022-04-08 09:45:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-08 09:45:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:42,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198560990] [2022-04-08 09:45:42,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:42,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956252349] [2022-04-08 09:45:42,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956252349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:42,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:42,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 9] total 47 [2022-04-08 09:45:42,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:42,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41128050] [2022-04-08 09:45:42,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41128050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:42,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:42,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 09:45:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814548982] [2022-04-08 09:45:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 09:45:42,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:42,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:42,453 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-08 09:45:42,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 09:45:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 09:45:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 09:45:42,456 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:45,741 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 09:45:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 09:45:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 09:45:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-08 09:45:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-08 09:45:45,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-08 09:45:45,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:45:45,809 INFO L225 Difference]: With dead ends: 56 [2022-04-08 09:45:45,809 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 09:45:45,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 09:45:45,810 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:45,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 286 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 09:45:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 09:45:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 09:45:45,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:45,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,842 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,842 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:45,842 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:45:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:45:45,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:45,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:45,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 09:45:45,843 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 09:45:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:45,846 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:45:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:45:45,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:45,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:45,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:45,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-08 09:45:45,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-08 09:45:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:45,847 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-08 09:45:45,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:45,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-08 09:45:45,937 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-08 09:45:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:45:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 09:45:45,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:45,937 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:45,954 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-08 09:45:46,139 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-08 09:45:46,139 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 37 times [2022-04-08 09:45:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:46,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331577929] [2022-04-08 09:45:46,144 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:46,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 38 times [2022-04-08 09:45:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:46,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891681867] [2022-04-08 09:45:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:46,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445497513] [2022-04-08 09:45:46,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:45:46,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:46,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:46,159 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-08 09:45:46,181 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-08 09:45:46,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:45:46,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:46,208 WARN L261 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-08 09:45:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:46,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:47,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {7987#true} call ULTIMATE.init(); {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {7987#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(9, 2); {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {7987#true} assume true; {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7987#true} {7987#true} #55#return; {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {7987#true} call #t~ret3 := main(); {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {7987#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7987#true} is VALID [2022-04-08 09:45:47,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {7987#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8010#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:47,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {8010#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8014#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:45:47,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {8014#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8018#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:45:47,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {8018#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8022#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:45:47,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {8022#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8026#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:45:47,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {8026#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8030#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-08 09:45:47,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {8030#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8034#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:45:47,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {8034#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8038#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:45:47,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {8038#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8042#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:47,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {8042#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8046#(and (= main_~sum~0 (* main_~i~0 3)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:45:47,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {8046#(and (= main_~sum~0 (* main_~i~0 3)) (= 3 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8050#(and (= (+ main_~i~0 (- 3)) 3) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-08 09:45:47,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {8050#(and (= (+ main_~i~0 (- 3)) 3) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8054#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} is VALID [2022-04-08 09:45:47,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {8054#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8058#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:45:47,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:45:47,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {8062#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8066#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} is VALID [2022-04-08 09:45:47,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {8066#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8070#(and (= 21 (+ (* (- 1) main_~i~0) main_~sum~0 (- 7))) (= main_~i~0 8))} is VALID [2022-04-08 09:45:47,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {8070#(and (= 21 (+ (* (- 1) main_~i~0) main_~sum~0 (- 7))) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8074#(and (= 21 (+ (- 15) main_~sum~0)) (= main_~i~0 9))} is VALID [2022-04-08 09:45:47,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {8074#(and (= 21 (+ (- 15) main_~sum~0)) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8078#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:45:47,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {8078#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8082#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:45:47,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8086#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-08 09:45:47,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {8086#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8090#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} is VALID [2022-04-08 09:45:47,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {8090#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8094#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-08 09:45:47,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {8094#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8098#(and (= main_~sum~0 (+ main_~i~0 54)) (= (+ (- 1) main_~i~0) 11))} is VALID [2022-04-08 09:45:47,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {8098#(and (= main_~sum~0 (+ main_~i~0 54)) (= (+ (- 1) main_~i~0) 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8102#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-08 09:45:47,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {8102#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8106#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:45:47,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8110#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:45:47,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {8110#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8114#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} is VALID [2022-04-08 09:45:47,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {8114#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8118#(and (= (+ (- 1) main_~i~0) 13) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 77 main_~i~0)))} is VALID [2022-04-08 09:45:47,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {8118#(and (= (+ (- 1) main_~i~0) 13) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 77 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8122#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:45:47,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {8122#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8126#(and (= main_~i~0 15) (= 91 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:45:47,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {8126#(and (= main_~i~0 15) (= 91 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8130#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:45:47,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {8130#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8134#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-08 09:45:47,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {8134#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8138#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:45:47,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {8138#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8142#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:45:47,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {8142#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8146#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-08 09:45:47,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {8146#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8150#(and (= (+ main_~i~0 (- 3)) 15) (= (+ (* main_~i~0 2) 100) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-08 09:45:47,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {8150#(and (= (+ main_~i~0 (- 3)) 15) (= (+ (* main_~i~0 2) 100) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8154#(and (= 15 (+ main_~i~0 (- 4))) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 98 (* main_~i~0 2))))} is VALID [2022-04-08 09:45:47,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {8154#(and (= 15 (+ main_~i~0 (- 4))) (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 98 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8158#(and (= 15 (+ main_~i~0 (- 4))) (<= main_~i~0 main_~n~0) (= (+ (* 5 main_~i~0) 95) main_~sum~0))} is VALID [2022-04-08 09:45:47,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {8158#(and (= 15 (+ main_~i~0 (- 4))) (<= main_~i~0 main_~n~0) (= (+ (* 5 main_~i~0) 95) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8162#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (<= main_~i~0 20))} is VALID [2022-04-08 09:45:47,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {8162#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (<= main_~i~0 20))} assume !(~i~0 <= ~n~0); {8166#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (< main_~n~0 20))} is VALID [2022-04-08 09:45:47,199 INFO L272 TraceCheckUtils]: 46: Hoare triple {8166#(and (<= 19 main_~n~0) (= 190 main_~sum~0) (< main_~n~0 20))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:47,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:47,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {8174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7988#false} is VALID [2022-04-08 09:45:47,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {7988#false} assume !false; {7988#false} is VALID [2022-04-08 09:45:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:47,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:55,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {7988#false} assume !false; {7988#false} is VALID [2022-04-08 09:45:55,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {8174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7988#false} is VALID [2022-04-08 09:45:55,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:45:55,793 INFO L272 TraceCheckUtils]: 46: Hoare triple {8190#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:45:55,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {8194#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {8190#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:45:55,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {8198#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8194#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:55,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8198#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:45:55,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8206#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:45:55,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {7987#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8202#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:45:55,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {7987#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7987#true} is VALID [2022-04-08 09:45:55,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {7987#true} call #t~ret3 := main(); {7987#true} is VALID [2022-04-08 09:45:55,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7987#true} {7987#true} #55#return; {7987#true} is VALID [2022-04-08 09:45:55,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {7987#true} assume true; {7987#true} is VALID [2022-04-08 09:45:55,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {7987#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(9, 2); {7987#true} is VALID [2022-04-08 09:45:55,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {7987#true} call ULTIMATE.init(); {7987#true} is VALID [2022-04-08 09:45:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-08 09:45:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:55,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891681867] [2022-04-08 09:45:55,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:55,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445497513] [2022-04-08 09:45:55,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445497513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:55,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:55,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 9] total 49 [2022-04-08 09:45:55,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:55,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331577929] [2022-04-08 09:45:55,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331577929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:55,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:55,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 09:45:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820305459] [2022-04-08 09:45:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:55,977 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 09:45:55,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:55,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:56,037 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-08 09:45:56,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 09:45:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 09:45:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2209, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 09:45:56,038 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:59,135 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 09:45:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 09:45:59,135 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 09:45:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-08 09:45:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-08 09:45:59,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-08 09:45:59,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:45:59,223 INFO L225 Difference]: With dead ends: 58 [2022-04-08 09:45:59,223 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 09:45:59,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=154, Invalid=2396, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 09:45:59,224 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:59,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1846 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 09:45:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 09:45:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 09:45:59,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:59,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,248 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,249 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:59,249 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 09:45:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:45:59,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:59,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:59,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:45:59,250 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:45:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:59,251 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 09:45:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:45:59,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:59,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:59,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:59,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-08 09:45:59,252 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-08 09:45:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:59,252 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-08 09:45:59,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:59,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-08 09:45:59,395 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-08 09:45:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:45:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 09:45:59,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:59,396 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:59,412 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-08 09:45:59,596 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-08 09:45:59,596 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -648288915, now seen corresponding path program 39 times [2022-04-08 09:45:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232602608] [2022-04-08 09:45:59,599 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:45:59,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:45:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -648288915, now seen corresponding path program 40 times [2022-04-08 09:45:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595716605] [2022-04-08 09:45:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:59,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:59,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733159330] [2022-04-08 09:45:59,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:45:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:59,615 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-08 09:45:59,616 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-08 09:45:59,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:45:59,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:59,669 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 09:45:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:59,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:00,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {8667#true} call ULTIMATE.init(); {8667#true} is VALID [2022-04-08 09:46:00,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {8667#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(9, 2); {8667#true} is VALID [2022-04-08 09:46:00,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {8667#true} assume true; {8667#true} is VALID [2022-04-08 09:46:00,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8667#true} {8667#true} #55#return; {8667#true} is VALID [2022-04-08 09:46:00,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {8667#true} call #t~ret3 := main(); {8667#true} is VALID [2022-04-08 09:46:00,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {8667#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8667#true} is VALID [2022-04-08 09:46:00,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8690#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:00,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {8690#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8694#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:00,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {8694#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8698#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-08 09:46:00,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {8698#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8702#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:46:00,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {8702#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8706#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:46:00,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {8706#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8710#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:46:00,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {8710#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 1) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8714#(and (= main_~i~0 4) (= (+ main_~sum~0 (- 5)) 1))} is VALID [2022-04-08 09:46:00,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {8714#(and (= main_~i~0 4) (= (+ main_~sum~0 (- 5)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8718#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:46:00,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {8718#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8722#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:46:00,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {8722#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8726#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:46:00,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {8726#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8730#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-08 09:46:00,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8734#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-08 09:46:00,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {8734#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8738#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:46:00,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {8738#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8742#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} is VALID [2022-04-08 09:46:00,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {8742#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8746#(and (= (+ (- 3) (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 4)) 4))} is VALID [2022-04-08 09:46:00,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(and (= (+ (- 3) (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 4)) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8750#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} is VALID [2022-04-08 09:46:00,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {8750#(and (= (+ main_~i~0 (- 4)) 4) (= (+ (* 5 main_~i~0) (- 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8754#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:46:00,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {8754#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8758#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:46:00,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {8758#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8762#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:46:00,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {8762#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8766#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-08 09:46:00,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {8766#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8770#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-08 09:46:00,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {8770#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8774#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 44))) (= (+ (* (- 1) main_~i~0) (- 45) main_~sum~0) 10))} is VALID [2022-04-08 09:46:00,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {8774#(and (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 44))) (= (+ (* (- 1) main_~i~0) (- 45) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8778#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:46:00,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {8778#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8782#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} is VALID [2022-04-08 09:46:00,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {8782#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8786#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:46:00,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {8786#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8790#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:46:00,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {8790#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8794#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:46:00,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {8794#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8798#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} is VALID [2022-04-08 09:46:00,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {8798#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8802#(and (= (+ main_~i~0 (- 3)) 12) (= main_~sum~0 (+ 60 (* main_~i~0 3))))} is VALID [2022-04-08 09:46:00,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {8802#(and (= (+ main_~i~0 (- 3)) 12) (= main_~sum~0 (+ 60 (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8806#(and (= main_~sum~0 (+ 60 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 09:46:00,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {8806#(and (= main_~sum~0 (+ 60 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8810#(and (= main_~i~0 16) (= main_~sum~0 120))} is VALID [2022-04-08 09:46:00,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {8810#(and (= main_~i~0 16) (= main_~sum~0 120))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8814#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) main_~sum~0) 120))} is VALID [2022-04-08 09:46:00,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {8814#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) main_~sum~0) 120))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8818#(and (= 120 (+ (- 16) main_~sum~0)) (= main_~i~0 17))} is VALID [2022-04-08 09:46:00,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {8818#(and (= 120 (+ (- 16) main_~sum~0)) (= main_~i~0 17))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8822#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-08 09:46:00,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {8822#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8826#(and (= 153 main_~sum~0) (= main_~i~0 18))} is VALID [2022-04-08 09:46:00,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {8826#(and (= 153 main_~sum~0) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8830#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} is VALID [2022-04-08 09:46:00,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {8830#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8834#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} is VALID [2022-04-08 09:46:00,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {8834#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8838#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-08 09:46:00,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {8838#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8842#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:46:00,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {8842#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8846#(and (<= main_~i~0 main_~n~0) (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:46:00,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#(and (<= main_~i~0 main_~n~0) (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8850#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:46:00,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {8850#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} assume !(~i~0 <= ~n~0); {8854#(and (<= 20 main_~n~0) (< main_~n~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:46:00,821 INFO L272 TraceCheckUtils]: 48: Hoare triple {8854#(and (<= 20 main_~n~0) (< main_~n~0 21) (= main_~sum~0 210))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:00,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:00,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {8862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8668#false} is VALID [2022-04-08 09:46:00,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {8668#false} assume !false; {8668#false} is VALID [2022-04-08 09:46:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:00,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:10,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {8668#false} assume !false; {8668#false} is VALID [2022-04-08 09:46:10,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {8862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8668#false} is VALID [2022-04-08 09:46:10,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:10,457 INFO L272 TraceCheckUtils]: 48: Hoare triple {8878#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:10,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {8882#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {8878#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:46:10,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {8886#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8882#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:10,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8886#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:10,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8894#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:10,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8890#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:10,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {8667#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8667#true} is VALID [2022-04-08 09:46:10,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {8667#true} call #t~ret3 := main(); {8667#true} is VALID [2022-04-08 09:46:10,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8667#true} {8667#true} #55#return; {8667#true} is VALID [2022-04-08 09:46:10,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {8667#true} assume true; {8667#true} is VALID [2022-04-08 09:46:10,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {8667#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(9, 2); {8667#true} is VALID [2022-04-08 09:46:10,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {8667#true} call ULTIMATE.init(); {8667#true} is VALID [2022-04-08 09:46:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-08 09:46:10,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595716605] [2022-04-08 09:46:10,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:46:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733159330] [2022-04-08 09:46:10,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733159330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:10,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:46:10,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 9] total 51 [2022-04-08 09:46:10,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232602608] [2022-04-08 09:46:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232602608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-08 09:46:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242354938] [2022-04-08 09:46:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 09:46:10,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:10,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,762 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-08 09:46:10,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-08 09:46:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-08 09:46:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2401, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 09:46:10,763 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:14,494 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-08 09:46:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-08 09:46:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 09:46:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-08 09:46:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-08 09:46:14,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-08 09:46:14,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:14,562 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:46:14,562 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 09:46:14,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=160, Invalid=2596, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 09:46:14,563 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:14,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 09:46:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 09:46:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 09:46:14,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:14,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,592 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,592 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:14,593 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 09:46:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 09:46:14,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:14,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:14,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-08 09:46:14,593 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-08 09:46:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:14,594 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 09:46:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 09:46:14,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:14,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:14,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:14,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-08 09:46:14,595 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-08 09:46:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:14,595 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-08 09:46:14,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:14,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-08 09:46:14,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 09:46:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 09:46:14,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:14,678 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:14,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 09:46:14,891 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-08 09:46:14,892 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 41 times [2022-04-08 09:46:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:14,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554942085] [2022-04-08 09:46:14,901 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:14,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 42 times [2022-04-08 09:46:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:14,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795111744] [2022-04-08 09:46:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:14,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:46:14,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236516480] [2022-04-08 09:46:14,914 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:46:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:14,915 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-08 09:46:14,934 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-08 09:46:14,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 09:46:14,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:14,985 WARN L261 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 09:46:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:14,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:16,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {9373#true} call ULTIMATE.init(); {9373#true} is VALID [2022-04-08 09:46:16,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {9373#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(9, 2); {9373#true} is VALID [2022-04-08 09:46:16,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {9373#true} assume true; {9373#true} is VALID [2022-04-08 09:46:16,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9373#true} {9373#true} #55#return; {9373#true} is VALID [2022-04-08 09:46:16,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {9373#true} call #t~ret3 := main(); {9373#true} is VALID [2022-04-08 09:46:16,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {9373#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9373#true} is VALID [2022-04-08 09:46:16,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {9373#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9396#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:16,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {9396#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9400#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:16,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {9400#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9404#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:46:16,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {9404#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9408#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:46:16,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {9408#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9412#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:46:16,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {9412#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9416#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:46:16,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {9416#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9420#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:46:16,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {9420#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9424#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:46:16,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9428#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:46:16,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {9428#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9432#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:46:16,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {9432#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9436#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:46:16,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {9436#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9440#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:46:16,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {9440#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9444#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:46:16,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {9444#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9448#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:46:16,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {9448#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9452#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} is VALID [2022-04-08 09:46:16,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#(and (= 6 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 12 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9456#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:46:16,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {9456#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9460#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 09:46:16,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {9460#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9464#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 09:46:16,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {9464#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9468#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:46:16,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {9468#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9472#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} is VALID [2022-04-08 09:46:16,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {9472#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 45) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9476#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} is VALID [2022-04-08 09:46:16,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {9476#(and (= main_~i~0 11) (= 45 (+ main_~sum~0 (- 10))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9480#(and (= main_~i~0 11) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 45))} is VALID [2022-04-08 09:46:16,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {9480#(and (= main_~i~0 11) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 45))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9484#(and (= (+ (- 1) main_~i~0) 11) (= 45 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:46:16,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {9484#(and (= (+ (- 1) main_~i~0) 11) (= 45 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9488#(and (= (+ (- 1) main_~i~0) 11) (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 45))} is VALID [2022-04-08 09:46:16,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {9488#(and (= (+ (- 1) main_~i~0) 11) (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 45))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9492#(and (= 45 (+ main_~sum~0 (- 33))) (= main_~i~0 13))} is VALID [2022-04-08 09:46:16,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {9492#(and (= 45 (+ main_~sum~0 (- 33))) (= main_~i~0 13))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9496#(and (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 33))) (= main_~i~0 13))} is VALID [2022-04-08 09:46:16,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {9496#(and (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 33))) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9500#(and (= (+ (- 1) main_~i~0) 13) (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} is VALID [2022-04-08 09:46:16,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {9500#(and (= (+ (- 1) main_~i~0) 13) (= 45 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9504#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 32)) 45) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-08 09:46:16,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {9504#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 32)) 45) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9508#(and (= (+ (- 2) main_~i~0) 13) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 30)) 45))} is VALID [2022-04-08 09:46:16,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {9508#(and (= (+ (- 2) main_~i~0) 13) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 30)) 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9512#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 3) 75) main_~sum~0))} is VALID [2022-04-08 09:46:16,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {9512#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 3) 75) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9516#(and (= (+ main_~i~0 (- 3)) 13) (= (+ 72 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:46:16,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {9516#(and (= (+ main_~i~0 (- 3)) 13) (= (+ 72 (* main_~i~0 3)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9520#(and (= (+ main_~i~0 (- 3)) 13) (= main_~sum~0 (+ 72 (* main_~i~0 4))))} is VALID [2022-04-08 09:46:16,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {9520#(and (= (+ main_~i~0 (- 3)) 13) (= main_~sum~0 (+ 72 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9524#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2022-04-08 09:46:16,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {9524#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9528#(and (= main_~i~0 17) (= (+ (* (- 1) main_~i~0) main_~sum~0) 136))} is VALID [2022-04-08 09:46:16,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {9528#(and (= main_~i~0 17) (= (+ (* (- 1) main_~i~0) main_~sum~0) 136))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9532#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-08 09:46:16,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {9532#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9536#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} is VALID [2022-04-08 09:46:16,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {9536#(and (= 17 (+ (* (- 1) main_~i~0) main_~sum~0 (- 136))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 135))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9540#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 134) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 135)) 17))} is VALID [2022-04-08 09:46:16,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {9540#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 134) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 135)) 17))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9544#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 (* main_~i~0 2))))} is VALID [2022-04-08 09:46:16,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {9544#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9548#(and (= (+ (- 2) main_~i~0) 18) (= (+ 150 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:46:16,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {9548#(and (= (+ (- 2) main_~i~0) 18) (= (+ 150 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 150 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 18))} is VALID [2022-04-08 09:46:16,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {9552#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 150 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9556#(and (= main_~i~0 21) (= 190 (+ (- 20) main_~sum~0)))} is VALID [2022-04-08 09:46:16,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {9556#(and (= main_~i~0 21) (= 190 (+ (- 20) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9560#(and (= main_~i~0 21) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-08 09:46:16,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {9560#(and (= main_~i~0 21) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9564#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (<= (+ main_~i~0 209) main_~sum~0))} is VALID [2022-04-08 09:46:16,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {9564#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (<= (+ main_~i~0 209) main_~sum~0))} assume !(~i~0 <= ~n~0); {9568#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (< (+ main_~n~0 209) main_~sum~0))} is VALID [2022-04-08 09:46:16,203 INFO L272 TraceCheckUtils]: 50: Hoare triple {9568#(and (<= main_~sum~0 (+ main_~n~0 210)) (= (+ (- 210) main_~sum~0) 21) (< (+ main_~n~0 209) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:16,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:16,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {9576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9374#false} is VALID [2022-04-08 09:46:16,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {9374#false} assume !false; {9374#false} is VALID [2022-04-08 09:46:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:16,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:27,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {9374#false} assume !false; {9374#false} is VALID [2022-04-08 09:46:27,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {9576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9374#false} is VALID [2022-04-08 09:46:27,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:27,438 INFO L272 TraceCheckUtils]: 50: Hoare triple {9592#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:27,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {9596#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {9592#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:46:27,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {9600#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9596#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:27,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9600#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:27,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9608#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:27,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {9373#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9604#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:27,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {9373#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {9373#true} call #t~ret3 := main(); {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9373#true} {9373#true} #55#return; {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {9373#true} assume true; {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {9373#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(9, 2); {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {9373#true} call ULTIMATE.init(); {9373#true} is VALID [2022-04-08 09:46:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-08 09:46:27,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:27,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795111744] [2022-04-08 09:46:27,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:46:27,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236516480] [2022-04-08 09:46:27,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236516480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:27,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:46:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 9] total 53 [2022-04-08 09:46:27,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:27,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554942085] [2022-04-08 09:46:27,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554942085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:27,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-08 09:46:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996417781] [2022-04-08 09:46:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-08 09:46:27,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:27,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:27,806 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-08 09:46:27,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-08 09:46:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-08 09:46:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2601, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 09:46:27,807 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:33,000 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-08 09:46:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-08 09:46:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-08 09:46:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-08 09:46:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-08 09:46:33,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-08 09:46:33,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:33,105 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:46:33,105 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 09:46:33,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 21 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=166, Invalid=2804, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 09:46:33,106 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:33,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 09:46:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 09:46:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 09:46:33,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:33,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,134 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,134 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:33,134 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 09:46:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 09:46:33,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:33,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:33,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 09:46:33,135 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-08 09:46:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:33,135 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 09:46:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 09:46:33,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:33,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:33,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:33,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-08 09:46:33,136 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-08 09:46:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:33,137 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-08 09:46:33,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:33,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-08 09:46:33,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 09:46:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 09:46:33,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:33,231 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:33,252 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-08 09:46:33,432 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-08 09:46:33,432 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 686793513, now seen corresponding path program 43 times [2022-04-08 09:46:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:33,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812041133] [2022-04-08 09:46:33,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:33,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash 686793513, now seen corresponding path program 44 times [2022-04-08 09:46:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032561172] [2022-04-08 09:46:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:33,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:46:33,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120800591] [2022-04-08 09:46:33,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:46:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:33,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:33,452 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-08 09:46:33,453 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-08 09:46:33,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:46:33,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:33,501 WARN L261 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 09:46:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:33,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:35,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {10105#true} call ULTIMATE.init(); {10105#true} is VALID [2022-04-08 09:46:35,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {10105#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(9, 2); {10105#true} is VALID [2022-04-08 09:46:35,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {10105#true} assume true; {10105#true} is VALID [2022-04-08 09:46:35,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10105#true} {10105#true} #55#return; {10105#true} is VALID [2022-04-08 09:46:35,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {10105#true} call #t~ret3 := main(); {10105#true} is VALID [2022-04-08 09:46:35,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {10105#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10105#true} is VALID [2022-04-08 09:46:35,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {10105#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10128#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:35,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {10128#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10132#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:35,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {10132#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10136#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:46:35,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {10136#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10140#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:46:35,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {10140#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10144#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:46:35,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {10144#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10148#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:46:35,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {10148#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10152#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:46:35,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {10152#(and (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 1) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10156#(and (= (+ (- 1) main_~sum~0 (* (- 2) main_~i~0)) 1) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:46:35,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {10156#(and (= (+ (- 1) main_~sum~0 (* (- 2) main_~i~0)) 1) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10160#(and (= 5 main_~i~0) (= (+ (- 9) main_~sum~0) 1))} is VALID [2022-04-08 09:46:35,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {10160#(and (= 5 main_~i~0) (= (+ (- 9) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10164#(and (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 1) (= 5 main_~i~0))} is VALID [2022-04-08 09:46:35,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {10164#(and (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 1) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10168#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:46:35,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {10168#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10172#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:46:35,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {10172#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10176#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:46:35,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {10176#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10180#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:46:35,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {10180#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10184#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} is VALID [2022-04-08 09:46:35,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {10184#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10188#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} is VALID [2022-04-08 09:46:35,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {10188#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10192#(and (= 5 (+ main_~i~0 (- 4))) (= (+ (* main_~i~0 3) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:46:35,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {10192#(and (= 5 (+ main_~i~0 (- 4))) (= (+ (* main_~i~0 3) 1) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10196#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 3) 1)) (= 5 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:46:35,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {10196#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 3) 1)) (= 5 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10200#(and (= (+ main_~i~0 (- 5)) 5) (= (+ (- 2) (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:46:35,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {10200#(and (= (+ main_~i~0 (- 5)) 5) (= (+ (- 2) (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10204#(and (= (+ (* main_~i~0 6) (- 5)) main_~sum~0) (= (+ main_~i~0 (- 5)) 5))} is VALID [2022-04-08 09:46:35,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {10204#(and (= (+ (* main_~i~0 6) (- 5)) main_~sum~0) (= (+ main_~i~0 (- 5)) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10208#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:46:35,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {10208#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10212#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:46:35,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {10212#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10216#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:46:35,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {10216#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10220#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:46:35,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {10220#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10224#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:46:35,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10228#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:46:35,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {10228#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10232#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:46:35,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {10232#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10236#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:46:35,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10240#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:46:35,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {10240#(and (= main_~i~0 15) (= 91 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10244#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-08 09:46:35,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {10244#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10248#(and (= main_~sum~0 (+ 104 main_~i~0)) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-08 09:46:35,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {10248#(and (= main_~sum~0 (+ 104 main_~i~0)) (= (+ (- 1) main_~i~0) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10252#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-08 09:46:35,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {10252#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10256#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:46:35,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {10256#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10260#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:46:35,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {10260#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10264#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-08 09:46:35,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {10264#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10268#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} is VALID [2022-04-08 09:46:35,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {10268#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10272#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-08 09:46:35,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {10272#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10276#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} is VALID [2022-04-08 09:46:35,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {10276#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10280#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-08 09:46:35,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {10280#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10284#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:46:35,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {10284#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10288#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} is VALID [2022-04-08 09:46:35,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {10288#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10292#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} is VALID [2022-04-08 09:46:35,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {10292#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10296#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 188) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) 20))} is VALID [2022-04-08 09:46:35,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {10296#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 188) main_~sum~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) 20))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10300#(and (= (+ 187 (* main_~i~0 3)) main_~sum~0) (<= main_~i~0 main_~n~0) (= 20 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:46:35,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {10300#(and (= (+ 187 (* main_~i~0 3)) main_~sum~0) (<= main_~i~0 main_~n~0) (= 20 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#(and (<= 22 main_~n~0) (<= main_~i~0 23) (= main_~sum~0 253))} is VALID [2022-04-08 09:46:35,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {10304#(and (<= 22 main_~n~0) (<= main_~i~0 23) (= main_~sum~0 253))} assume !(~i~0 <= ~n~0); {10308#(and (< main_~n~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2022-04-08 09:46:35,310 INFO L272 TraceCheckUtils]: 52: Hoare triple {10308#(and (< main_~n~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:35,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:35,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {10316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10106#false} is VALID [2022-04-08 09:46:35,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {10106#false} assume !false; {10106#false} is VALID [2022-04-08 09:46:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:35,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:49,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {10106#false} assume !false; {10106#false} is VALID [2022-04-08 09:46:49,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {10316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10106#false} is VALID [2022-04-08 09:46:49,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:49,055 INFO L272 TraceCheckUtils]: 52: Hoare triple {10332#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {10312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:49,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {10336#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {10332#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:46:49,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {10340#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10336#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:49,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10340#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:46:49,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10348#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:46:49,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {10105#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10344#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:46:49,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {10105#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10105#true} is VALID [2022-04-08 09:46:49,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {10105#true} call #t~ret3 := main(); {10105#true} is VALID [2022-04-08 09:46:49,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10105#true} {10105#true} #55#return; {10105#true} is VALID [2022-04-08 09:46:49,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {10105#true} assume true; {10105#true} is VALID [2022-04-08 09:46:49,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {10105#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(9, 2); {10105#true} is VALID [2022-04-08 09:46:49,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {10105#true} call ULTIMATE.init(); {10105#true} is VALID [2022-04-08 09:46:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-08 09:46:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:49,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032561172] [2022-04-08 09:46:49,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:46:49,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120800591] [2022-04-08 09:46:49,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120800591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:49,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:46:49,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 9] total 55 [2022-04-08 09:46:49,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:49,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812041133] [2022-04-08 09:46:49,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812041133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:49,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:49,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-08 09:46:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377922736] [2022-04-08 09:46:49,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:49,252 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 09:46:49,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:49,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:49,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:49,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-08 09:46:49,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-08 09:46:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2809, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 09:46:49,329 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:55,553 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-08 09:46:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-08 09:46:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-08 09:46:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 09:46:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 09:46:55,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 09:46:55,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:55,692 INFO L225 Difference]: With dead ends: 64 [2022-04-08 09:46:55,692 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 09:46:55,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 22 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=172, Invalid=3020, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 09:46:55,693 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:55,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 09:46:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 09:46:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 09:46:55,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:55,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,729 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,729 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:55,730 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-08 09:46:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 09:46:55,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:55,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:55,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 09:46:55,731 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 09:46:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:55,731 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-08 09:46:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 09:46:55,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:55,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:55,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:55,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-08 09:46:55,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-08 09:46:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:55,732 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-08 09:46:55,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:55,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-08 09:46:55,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:46:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 09:46:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 09:46:55,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:55,852 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:55,871 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-08 09:46:56,053 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-08 09:46:56,053 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 45 times [2022-04-08 09:46:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:56,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326031618] [2022-04-08 09:46:56,056 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:46:56,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:46:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 46 times [2022-04-08 09:46:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:56,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000458723] [2022-04-08 09:46:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:56,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:46:56,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822167535] [2022-04-08 09:46:56,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:46:56,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:56,076 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-08 09:46:56,079 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-08 09:46:56,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:46:56,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:56,126 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 09:46:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:56,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:57,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {10863#true} call ULTIMATE.init(); {10863#true} is VALID [2022-04-08 09:46:57,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#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(9, 2); {10863#true} is VALID [2022-04-08 09:46:57,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {10863#true} assume true; {10863#true} is VALID [2022-04-08 09:46:57,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10863#true} {10863#true} #55#return; {10863#true} is VALID [2022-04-08 09:46:57,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {10863#true} call #t~ret3 := main(); {10863#true} is VALID [2022-04-08 09:46:57,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {10863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10863#true} is VALID [2022-04-08 09:46:57,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {10863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10886#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:57,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {10886#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10890#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:46:57,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {10890#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10894#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:46:57,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {10894#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10898#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:46:57,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {10898#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10902#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-08 09:46:57,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {10902#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10906#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-08 09:46:57,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10910#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-08 09:46:57,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {10910#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10914#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-08 09:46:57,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10918#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:46:57,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {10918#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10922#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:46:57,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {10922#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10926#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} is VALID [2022-04-08 09:46:57,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {10926#(and (= (+ (- 1) main_~i~0) 5) (= main_~sum~0 (+ main_~i~0 9)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10930#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 9)) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:46:57,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {10930#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 9)) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10934#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} is VALID [2022-04-08 09:46:57,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {10934#(and (= (+ main_~sum~0 (- 6)) 15) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10938#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} is VALID [2022-04-08 09:46:57,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {10938#(and (= 7 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10942#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} is VALID [2022-04-08 09:46:57,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {10942#(and (= (+ (- 13) main_~sum~0) 15) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10946#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-08 09:46:57,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {10946#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10950#(and (= main_~sum~0 36) (= main_~i~0 9))} is VALID [2022-04-08 09:46:57,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {10950#(and (= main_~sum~0 36) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10954#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:46:57,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {10954#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10958#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:46:57,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {10958#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10962#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-08 09:46:57,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {10962#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10966#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} is VALID [2022-04-08 09:46:57,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {10966#(and (= 9 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 33 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10970#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:46:57,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {10970#(and (= main_~sum~0 (+ 33 (* main_~i~0 3))) (= 9 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10974#(and (= main_~sum~0 (+ 30 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:46:57,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {10974#(and (= main_~sum~0 (+ 30 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10978#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 09:46:57,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {10978#(and (= main_~sum~0 (+ 30 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10982#(and (= 9 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 26 (* main_~i~0 4))))} is VALID [2022-04-08 09:46:57,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {10982#(and (= 9 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 26 (* main_~i~0 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10986#(and (= (+ (* 5 main_~i~0) 26) main_~sum~0) (= 9 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:46:57,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {10986#(and (= (+ (* 5 main_~i~0) 26) main_~sum~0) (= 9 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10990#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-08 09:46:57,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {10990#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10994#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:46:57,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {10994#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10998#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:46:57,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {10998#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11002#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:46:57,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {11002#(and (= (+ 90 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11006#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:46:57,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {11006#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11010#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:46:57,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {11010#(and (= 14 (+ (- 2) main_~i~0)) (= (+ 88 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11014#(and (= (+ main_~i~0 (- 3)) 14) (= main_~sum~0 (+ 85 (* main_~i~0 3))))} is VALID [2022-04-08 09:46:57,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {11014#(and (= (+ main_~i~0 (- 3)) 14) (= main_~sum~0 (+ 85 (* main_~i~0 3))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11018#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 85 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 14))} is VALID [2022-04-08 09:46:57,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {11018#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 85 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11022#(and (= (+ 82 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 14 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:46:57,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {11022#(and (= (+ 82 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 14 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11026#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 82 (* main_~i~0 3))) (= 14 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:46:57,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {11026#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 82 (* main_~i~0 3))) (= 14 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11030#(and (= 136 (+ main_~sum~0 (- 35))) (= 19 main_~i~0))} is VALID [2022-04-08 09:46:57,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {11030#(and (= 136 (+ main_~sum~0 (- 35))) (= 19 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11034#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-08 09:46:57,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {11034#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11038#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:46:57,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {11038#(and (= main_~sum~0 (+ 170 main_~i~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11042#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:46:57,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {11042#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11046#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:46:57,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {11046#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11050#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-08 09:46:57,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {11050#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11054#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-08 09:46:57,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {11054#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11058#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} is VALID [2022-04-08 09:46:57,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {11058#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11062#(and (= (+ main_~sum~0 (- 231)) 22) (= (+ main_~sum~0 (- 230)) main_~i~0))} is VALID [2022-04-08 09:46:57,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {11062#(and (= (+ main_~sum~0 (- 231)) 22) (= (+ main_~sum~0 (- 230)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11066#(and (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 230))) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 231)) 22))} is VALID [2022-04-08 09:46:57,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {11066#(and (<= main_~i~0 main_~n~0) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 230))) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 231)) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11070#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (<= (+ main_~i~0 252) main_~sum~0))} is VALID [2022-04-08 09:46:57,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {11070#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (<= (+ main_~i~0 252) main_~sum~0))} assume !(~i~0 <= ~n~0); {11074#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (< (+ main_~n~0 252) main_~sum~0))} is VALID [2022-04-08 09:46:57,444 INFO L272 TraceCheckUtils]: 54: Hoare triple {11074#(and (<= main_~sum~0 (+ main_~n~0 253)) (= 23 (+ (- 253) main_~sum~0)) (< (+ main_~n~0 252) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:46:57,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:46:57,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {11082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10864#false} is VALID [2022-04-08 09:46:57,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {10864#false} assume !false; {10864#false} is VALID [2022-04-08 09:46:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:57,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:47:14,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {10864#false} assume !false; {10864#false} is VALID [2022-04-08 09:47:14,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {11082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10864#false} is VALID [2022-04-08 09:47:14,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:47:14,007 INFO L272 TraceCheckUtils]: 54: Hoare triple {11098#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:47:14,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {11102#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {11098#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:47:14,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {11106#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11102#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:47:14,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11106#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:47:14,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11114#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:14,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {10863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11110#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:14,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {10863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10863#true} is VALID [2022-04-08 09:47:14,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {10863#true} call #t~ret3 := main(); {10863#true} is VALID [2022-04-08 09:47:14,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10863#true} {10863#true} #55#return; {10863#true} is VALID [2022-04-08 09:47:14,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {10863#true} assume true; {10863#true} is VALID [2022-04-08 09:47:14,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {10863#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(9, 2); {10863#true} is VALID [2022-04-08 09:47:14,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {10863#true} call ULTIMATE.init(); {10863#true} is VALID [2022-04-08 09:47:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 09:47:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:47:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000458723] [2022-04-08 09:47:14,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:47:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822167535] [2022-04-08 09:47:14,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822167535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:47:14,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:47:14,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 9] total 57 [2022-04-08 09:47:14,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:47:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326031618] [2022-04-08 09:47:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326031618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:47:14,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:47:14,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-08 09:47:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077311091] [2022-04-08 09:47:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:47:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-08 09:47:14,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:47:14,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:14,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:14,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-08 09:47:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:47:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-08 09:47:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3025, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 09:47:14,394 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:21,237 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-08 09:47:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-08 09:47:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-08 09:47:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:47:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-08 09:47:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-08 09:47:21,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-08 09:47:21,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:21,374 INFO L225 Difference]: With dead ends: 66 [2022-04-08 09:47:21,374 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 09:47:21,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 37 SyntacticMatches, 23 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=178, Invalid=3244, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 09:47:21,375 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:47:21,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 09:47:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 09:47:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 09:47:21,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:47:21,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,421 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,421 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:21,422 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-08 09:47:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-08 09:47:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:21,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:47:21,422 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-08 09:47:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:21,423 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-08 09:47:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-08 09:47:21,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:21,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:21,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:47:21,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:47:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-08 09:47:21,433 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-08 09:47:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:47:21,433 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-08 09:47:21,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:21,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-08 09:47:21,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-08 09:47:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 09:47:21,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:47:21,525 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:47:21,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 09:47:21,741 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-08 09:47:21,745 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:47:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:47:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash -390716699, now seen corresponding path program 47 times [2022-04-08 09:47:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:47:21,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476818472] [2022-04-08 09:47:21,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:47:21,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:47:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -390716699, now seen corresponding path program 48 times [2022-04-08 09:47:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:47:21,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378970237] [2022-04-08 09:47:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:47:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:47:21,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:47:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030412957] [2022-04-08 09:47:21,804 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:47:21,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:47:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:47:21,805 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-08 09:47:21,809 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-08 09:47:21,862 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-08 09:47:21,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:47:21,864 WARN L261 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 09:47:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:47:21,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:47:23,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {11647#true} call ULTIMATE.init(); {11647#true} is VALID [2022-04-08 09:47:23,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {11647#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(9, 2); {11647#true} is VALID [2022-04-08 09:47:23,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {11647#true} assume true; {11647#true} is VALID [2022-04-08 09:47:23,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11647#true} {11647#true} #55#return; {11647#true} is VALID [2022-04-08 09:47:23,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {11647#true} call #t~ret3 := main(); {11647#true} is VALID [2022-04-08 09:47:23,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {11647#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11647#true} is VALID [2022-04-08 09:47:23,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {11647#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11670#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:47:23,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {11670#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11674#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:47:23,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {11674#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11678#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:47:23,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {11678#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11682#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:47:23,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {11682#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11686#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-08 09:47:23,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {11686#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11690#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-08 09:47:23,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {11690#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11694#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:47:23,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {11694#(and (= main_~sum~0 (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11698#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:47:23,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {11698#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 2)) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11702#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-08 09:47:23,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {11702#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11706#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:47:23,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {11706#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11710#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:47:23,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {11710#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11714#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:47:23,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {11714#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 5) (= main_~i~0 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11718#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:47:23,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {11718#(and (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 8))) (= 5 (+ (- 9) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11722#(and (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 5) (= (+ (- 1) main_~i~0) (+ main_~sum~0 (* (- 2) main_~i~0) (- 8))))} is VALID [2022-04-08 09:47:23,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {11722#(and (= (+ (- 9) main_~sum~0 (* (- 2) main_~i~0)) 5) (= (+ (- 1) main_~i~0) (+ main_~sum~0 (* (- 2) main_~i~0) (- 8))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11726#(and (= 5 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))) (= (+ main_~sum~0 (- 6) (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:23,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {11726#(and (= 5 (+ main_~sum~0 (- 7) (* (- 2) main_~i~0))) (= (+ main_~sum~0 (- 6) (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11730#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:23,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {11730#(and (= (+ (* main_~i~0 3) 12) main_~sum~0) (= 6 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11734#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 09:47:23,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {11734#(and (= (+ 9 (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11738#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 09:47:23,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {11738#(and (= main_~sum~0 (+ 9 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11742#(and (= main_~i~0 10) (= main_~sum~0 45))} is VALID [2022-04-08 09:47:23,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {11742#(and (= main_~i~0 10) (= main_~sum~0 45))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11746#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:47:23,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {11746#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11750#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-08 09:47:23,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {11750#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11754#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-08 09:47:23,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {11754#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11758#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:47:23,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {11758#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11762#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} is VALID [2022-04-08 09:47:23,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {11762#(and (= (+ (- 1) main_~i~0) 11) (= (+ (* main_~i~0 2) 54) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11766#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:47:23,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {11766#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11770#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:47:23,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {11770#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11774#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} is VALID [2022-04-08 09:47:23,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {11774#(and (= (+ (- 1) main_~i~0) 13) (= main_~sum~0 (+ 77 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11778#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} is VALID [2022-04-08 09:47:23,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {11778#(and (= main_~sum~0 (+ 77 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11782#(and (= (+ (* main_~i~0 2) 75) main_~sum~0) (= (+ (- 2) main_~i~0) 13))} is VALID [2022-04-08 09:47:23,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {11782#(and (= (+ (* main_~i~0 2) 75) main_~sum~0) (= (+ (- 2) main_~i~0) 13))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11786#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 2) 75) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:47:23,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {11786#(and (= (+ (- 2) main_~i~0) 13) (= (+ (* main_~i~0 2) 75) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11790#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} is VALID [2022-04-08 09:47:23,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {11790#(and (= main_~i~0 16) (= (+ (- 15) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11794#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} is VALID [2022-04-08 09:47:23,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {11794#(and (= main_~i~0 16) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11798#(and (= (+ (- 1) main_~i~0) 16) (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-08 09:47:23,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {11798#(and (= (+ (- 1) main_~i~0) 16) (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11802#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-08 09:47:23,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {11802#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11806#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:47:23,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {11806#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11810#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-08 09:47:23,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {11810#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11814#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-08 09:47:23,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {11814#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11818#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} is VALID [2022-04-08 09:47:23,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {11818#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 171) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11822#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:47:23,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {11822#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11826#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:47:23,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {11826#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11830#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:47:23,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {11830#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11834#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-08 09:47:23,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {11834#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11838#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-08 09:47:23,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {11838#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11842#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:47:23,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {11842#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11846#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:23,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {11846#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11850#(and (= main_~sum~0 (+ 207 (* main_~i~0 3))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:23,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {11850#(and (= main_~sum~0 (+ 207 (* main_~i~0 3))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11854#(and (= 276 main_~sum~0) (= main_~i~0 24))} is VALID [2022-04-08 09:47:23,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {11854#(and (= 276 main_~sum~0) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11858#(and (<= main_~i~0 main_~n~0) (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} is VALID [2022-04-08 09:47:23,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {11858#(and (<= main_~i~0 main_~n~0) (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11862#(and (<= main_~sum~0 (+ 276 main_~n~0)) (<= (+ main_~i~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:47:23,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {11862#(and (<= main_~sum~0 (+ 276 main_~n~0)) (<= (+ main_~i~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} assume !(~i~0 <= ~n~0); {11866#(and (<= main_~sum~0 (+ 276 main_~n~0)) (< (+ main_~n~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:47:23,822 INFO L272 TraceCheckUtils]: 56: Hoare triple {11866#(and (<= main_~sum~0 (+ 276 main_~n~0)) (< (+ main_~n~0 275) main_~sum~0) (= (+ main_~sum~0 (- 276)) 24))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:47:23,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:47:23,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11648#false} is VALID [2022-04-08 09:47:23,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#false} assume !false; {11648#false} is VALID [2022-04-08 09:47:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:47:23,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:47:39,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {11648#false} assume !false; {11648#false} is VALID [2022-04-08 09:47:39,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11648#false} is VALID [2022-04-08 09:47:39,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:47:39,629 INFO L272 TraceCheckUtils]: 56: Hoare triple {11890#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:47:39,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {11894#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {11890#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:47:39,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {11898#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11894#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:47:39,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11898#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:47:39,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:39,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:39,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:40,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:40,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:40,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11906#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:47:40,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {11647#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11902#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:47:40,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {11647#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11647#true} is VALID [2022-04-08 09:47:40,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {11647#true} call #t~ret3 := main(); {11647#true} is VALID [2022-04-08 09:47:40,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11647#true} {11647#true} #55#return; {11647#true} is VALID [2022-04-08 09:47:40,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {11647#true} assume true; {11647#true} is VALID [2022-04-08 09:47:40,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {11647#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(9, 2); {11647#true} is VALID [2022-04-08 09:47:40,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {11647#true} call ULTIMATE.init(); {11647#true} is VALID [2022-04-08 09:47:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-08 09:47:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:47:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378970237] [2022-04-08 09:47:40,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:47:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030412957] [2022-04-08 09:47:40,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030412957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:47:40,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:47:40,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 9] total 59 [2022-04-08 09:47:40,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:47:40,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476818472] [2022-04-08 09:47:40,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476818472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:47:40,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:47:40,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-08 09:47:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714345645] [2022-04-08 09:47:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:47:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 09:47:40,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:47:40,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:40,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:40,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-08 09:47:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:47:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-08 09:47:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3249, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 09:47:40,180 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:48,168 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-08 09:47:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-08 09:47:48,169 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-08 09:47:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:47:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-08 09:47:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-08 09:47:48,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-08 09:47:48,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:48,360 INFO L225 Difference]: With dead ends: 68 [2022-04-08 09:47:48,360 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 09:47:48,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 24 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=184, Invalid=3476, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 09:47:48,361 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:47:48,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 09:47:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 09:47:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 09:47:48,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:47:48,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,400 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,400 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:48,403 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-08 09:47:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-08 09:47:48,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:48,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:48,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-08 09:47:48,403 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-08 09:47:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:48,414 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-08 09:47:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-08 09:47:48,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:48,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:48,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:47:48,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:47:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-08 09:47:48,416 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-08 09:47:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:47:48,416 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-08 09:47:48,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:48,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-08 09:47:48,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:47:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-08 09:47:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 09:47:48,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:47:48,577 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:47:48,605 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-08 09:47:48,777 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-08 09:47:48,777 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:47:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:47:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 49 times [2022-04-08 09:47:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:47:48,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772341730] [2022-04-08 09:47:48,780 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:47:48,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:47:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 50 times [2022-04-08 09:47:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:47:48,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618052662] [2022-04-08 09:47:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:47:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:47:48,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:47:48,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310629067] [2022-04-08 09:47:48,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:47:48,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:47:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:47:48,795 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-08 09:47:48,796 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-08 09:47:48,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:47:48,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:47:48,841 WARN L261 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 09:47:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:47:48,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:47:50,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-08 09:47:50,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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(9, 2); {12457#true} is VALID [2022-04-08 09:47:50,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-08 09:47:50,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #55#return; {12457#true} is VALID [2022-04-08 09:47:50,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret3 := main(); {12457#true} is VALID [2022-04-08 09:47:50,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12457#true} is VALID [2022-04-08 09:47:50,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {12457#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12480#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:47:50,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {12480#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:47:50,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {12484#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12488#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:47:50,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {12488#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12492#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} is VALID [2022-04-08 09:47:50,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {12492#(and (= main_~i~0 2) (= (+ (- 1) (* (- 1) main_~i~0) main_~sum~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12496#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} is VALID [2022-04-08 09:47:50,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {12496#(and (= main_~i~0 3) (= (+ main_~sum~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12500#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} is VALID [2022-04-08 09:47:50,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {12500#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 0) (= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12504#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:47:50,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {12504#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12508#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-08 09:47:50,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {12508#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12512#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:47:50,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {12512#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12516#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:47:50,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {12516#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12520#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} is VALID [2022-04-08 09:47:50,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {12520#(and (= (+ (- 2) main_~i~0) 4) (= main_~sum~0 (+ 3 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12524#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-08 09:47:50,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {12524#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12528#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-08 09:47:50,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {12528#(and (= (+ main_~i~0 (- 3)) 4) (= main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12532#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} is VALID [2022-04-08 09:47:50,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {12532#(and (= (+ main_~i~0 (- 3)) 4) (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12536#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} is VALID [2022-04-08 09:47:50,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {12536#(and (= (+ main_~sum~0 (- 7)) 21) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12540#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-08 09:47:50,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {12540#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12544#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:47:50,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {12544#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12548#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:47:50,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {12548#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12552#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:50,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {12552#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12556#(and (= 8 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 25)))} is VALID [2022-04-08 09:47:50,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {12556#(and (= 8 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 25)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12560#(and (= main_~sum~0 (+ 22 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 8))} is VALID [2022-04-08 09:47:50,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {12560#(and (= main_~sum~0 (+ 22 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12564#(and (= (+ main_~i~0 (- 3)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 22 (* main_~i~0 3))))} is VALID [2022-04-08 09:47:50,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {12564#(and (= (+ main_~i~0 (- 3)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 22 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12568#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-08 09:47:50,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {12568#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12572#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:47:50,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {12572#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12576#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} is VALID [2022-04-08 09:47:50,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {12576#(and (= (+ (- 1) main_~i~0) 12) (= main_~sum~0 (+ main_~i~0 65)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12580#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:47:50,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {12580#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12584#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-08 09:47:50,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {12584#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12588#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:47:50,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {12588#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12592#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:47:50,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {12592#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12596#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:47:50,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {12596#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12600#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} is VALID [2022-04-08 09:47:50,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {12600#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12604#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} is VALID [2022-04-08 09:47:50,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {12604#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12608#(and (= main_~i~0 17) (= 91 (+ (- 45) main_~sum~0)))} is VALID [2022-04-08 09:47:50,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {12608#(and (= main_~i~0 17) (= 91 (+ (- 45) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12612#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-08 09:47:50,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {12612#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12616#(and (= (+ (- 1) main_~i~0) 17) (= (+ main_~i~0 135) main_~sum~0))} is VALID [2022-04-08 09:47:50,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {12616#(and (= (+ (- 1) main_~i~0) 17) (= (+ main_~i~0 135) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12620#(and (= (+ (- 1) main_~i~0) 17) (= main_~sum~0 (+ 135 (* main_~i~0 2))))} is VALID [2022-04-08 09:47:50,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {12620#(and (= (+ (- 1) main_~i~0) 17) (= main_~sum~0 (+ 135 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12624#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-08 09:47:50,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {12624#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12628#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-08 09:47:50,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {12628#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12632#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:47:50,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {12632#(and (= 19 (+ main_~sum~0 (- 171))) (= (+ (- 170) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12636#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:47:50,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {12636#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12640#(and (= main_~sum~0 (+ 168 (* main_~i~0 2))) (= 19 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:47:50,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {12640#(and (= main_~sum~0 (+ 168 (* main_~i~0 2))) (= 19 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12644#(and (= 19 (+ (- 2) main_~i~0)) (= (+ (* main_~i~0 3) 168) main_~sum~0))} is VALID [2022-04-08 09:47:50,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {12644#(and (= 19 (+ (- 2) main_~i~0)) (= (+ (* main_~i~0 3) 168) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12648#(and (= main_~sum~0 (+ (* main_~i~0 3) 165)) (= (+ main_~i~0 (- 3)) 19))} is VALID [2022-04-08 09:47:50,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {12648#(and (= main_~sum~0 (+ (* main_~i~0 3) 165)) (= (+ main_~i~0 (- 3)) 19))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12652#(and (= (+ main_~i~0 (- 3)) 19) (= (+ 165 (* main_~i~0 4)) main_~sum~0))} is VALID [2022-04-08 09:47:50,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {12652#(and (= (+ main_~i~0 (- 3)) 19) (= (+ 165 (* main_~i~0 4)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12656#(and (= 23 main_~i~0) (= main_~sum~0 253))} is VALID [2022-04-08 09:47:50,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {12656#(and (= 23 main_~i~0) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12660#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} is VALID [2022-04-08 09:47:50,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {12660#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12664#(and (= 23 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 252)))} is VALID [2022-04-08 09:47:50,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {12664#(and (= 23 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 252)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12668#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 252)) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:47:50,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {12668#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 252)) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12672#(and (= main_~i~0 25) (= 276 (+ main_~sum~0 (- 24))))} is VALID [2022-04-08 09:47:50,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {12672#(and (= main_~i~0 25) (= 276 (+ main_~sum~0 (- 24))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12676#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:47:50,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {12676#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12680#(and (<= main_~sum~0 (+ main_~n~0 300)) (<= (+ main_~i~0 299) main_~sum~0) (= (+ (- 300) main_~sum~0) 25))} is VALID [2022-04-08 09:47:50,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {12680#(and (<= main_~sum~0 (+ main_~n~0 300)) (<= (+ main_~i~0 299) main_~sum~0) (= (+ (- 300) main_~sum~0) 25))} assume !(~i~0 <= ~n~0); {12684#(and (<= main_~sum~0 (+ main_~n~0 300)) (= (+ (- 300) main_~sum~0) 25) (< (+ main_~n~0 299) main_~sum~0))} is VALID [2022-04-08 09:47:50,632 INFO L272 TraceCheckUtils]: 58: Hoare triple {12684#(and (<= main_~sum~0 (+ main_~n~0 300)) (= (+ (- 300) main_~sum~0) 25) (< (+ main_~n~0 299) main_~sum~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:47:50,632 INFO L290 TraceCheckUtils]: 59: Hoare triple {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:47:50,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {12692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-08 09:47:50,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-08 09:47:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:47:50,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:48:12,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {12458#false} assume !false; {12458#false} is VALID [2022-04-08 09:48:12,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {12692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12458#false} is VALID [2022-04-08 09:48:12,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:48:12,986 INFO L272 TraceCheckUtils]: 58: Hoare triple {12708#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {12688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:48:12,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {12712#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {12708#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:48:12,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {12716#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12712#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:48:12,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12716#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:48:13,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12724#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:13,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {12457#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12720#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:13,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {12457#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12457#true} is VALID [2022-04-08 09:48:13,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {12457#true} call #t~ret3 := main(); {12457#true} is VALID [2022-04-08 09:48:13,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12457#true} {12457#true} #55#return; {12457#true} is VALID [2022-04-08 09:48:13,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {12457#true} assume true; {12457#true} is VALID [2022-04-08 09:48:13,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {12457#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(9, 2); {12457#true} is VALID [2022-04-08 09:48:13,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {12457#true} call ULTIMATE.init(); {12457#true} is VALID [2022-04-08 09:48:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-08 09:48:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:48:13,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618052662] [2022-04-08 09:48:13,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:48:13,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310629067] [2022-04-08 09:48:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310629067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:48:13,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:48:13,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 9] total 61 [2022-04-08 09:48:13,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:48:13,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772341730] [2022-04-08 09:48:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772341730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:48:13,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:48:13,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-08 09:48:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510368046] [2022-04-08 09:48:13,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:48:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 09:48:13,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:48:13,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:13,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:13,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-08 09:48:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-08 09:48:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3481, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 09:48:13,431 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:21,488 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-08 09:48:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-08 09:48:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-08 09:48:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:48:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-08 09:48:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-08 09:48:21,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-08 09:48:21,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:21,667 INFO L225 Difference]: With dead ends: 70 [2022-04-08 09:48:21,668 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 09:48:21,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 25 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=190, Invalid=3716, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 09:48:21,668 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:48:21,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 09:48:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 09:48:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 09:48:21,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:48:21,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,714 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,714 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:21,716 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-08 09:48:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-08 09:48:21,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:21,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:21,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 09:48:21,716 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 09:48:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:21,717 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-08 09:48:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-08 09:48:21,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:21,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:21,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:48:21,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:48:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-08 09:48:21,718 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-08 09:48:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:48:21,718 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-08 09:48:21,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:21,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-08 09:48:21,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-08 09:48:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 09:48:21,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:48:21,912 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:48:21,928 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-08 09:48:22,112 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-08 09:48:22,112 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:48:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:48:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1568564385, now seen corresponding path program 51 times [2022-04-08 09:48:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939106843] [2022-04-08 09:48:22,115 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:48:22,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:48:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1568564385, now seen corresponding path program 52 times [2022-04-08 09:48:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:48:22,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588532913] [2022-04-08 09:48:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:48:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:48:22,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:48:22,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054946683] [2022-04-08 09:48:22,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:48:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:48:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:48:22,139 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-08 09:48:22,140 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-08 09:48:22,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:48:22,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:48:22,195 WARN L261 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 09:48:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:48:22,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:48:23,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {13293#true} call ULTIMATE.init(); {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {13293#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(9, 2); {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#true} assume true; {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13293#true} {13293#true} #55#return; {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {13293#true} call #t~ret3 := main(); {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13293#true} is VALID [2022-04-08 09:48:23,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {13293#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {13316#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:48:23,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {13316#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13320#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:48:23,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {13320#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13324#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:48:23,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {13324#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13328#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-08 09:48:23,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {13328#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13332#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:48:23,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {13332#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13336#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:48:23,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {13336#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13340#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:48:23,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {13340#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13344#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:48:23,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {13344#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13348#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-08 09:48:23,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {13348#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13352#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} is VALID [2022-04-08 09:48:23,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {13352#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 (- 4))) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13356#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 6) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:48:23,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {13356#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 6) (= (+ (- 1) main_~i~0) 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13360#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} is VALID [2022-04-08 09:48:23,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {13360#(and (= (+ 9 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13364#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:48:23,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {13364#(and (= main_~sum~0 (+ 7 (* main_~i~0 2))) (= 5 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13368#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:48:23,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {13368#(and (= (+ 7 (* main_~i~0 3)) main_~sum~0) (= 5 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13372#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} is VALID [2022-04-08 09:48:23,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {13372#(and (= (+ main_~i~0 (- 3)) 5) (= main_~sum~0 (+ (* main_~i~0 3) 4)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13376#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} is VALID [2022-04-08 09:48:23,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {13376#(and (= (+ main_~i~0 (- 3)) 5) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 3) 4)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13380#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} is VALID [2022-04-08 09:48:23,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {13380#(and (= (+ main_~sum~0 (- 8)) 28) (= main_~i~0 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13384#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:48:23,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {13384#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13388#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:48:23,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {13388#(and (= (+ (- 1) main_~i~0) 9) (= (+ 35 main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13392#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} is VALID [2022-04-08 09:48:23,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {13392#(and (= (+ (- 1) main_~i~0) 9) (= main_~sum~0 (+ 35 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13396#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:48:23,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {13396#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13400#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:48:23,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {13400#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13404#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-08 09:48:23,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {13404#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13408#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:48:23,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {13408#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13412#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:48:23,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {13412#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13416#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:48:23,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {13416#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13420#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:48:23,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {13420#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13424#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:48:23,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {13424#(and (= 12 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13428#(and (= (+ (* main_~i~0 2) 61) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 09:48:23,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {13428#(and (= (+ (* main_~i~0 2) 61) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13432#(and (= (+ (* main_~i~0 2) 61) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 09:48:23,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {13432#(and (= (+ (* main_~i~0 2) 61) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ main_~i~0 (- 3)) 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13436#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} is VALID [2022-04-08 09:48:23,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {13436#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13440#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} is VALID [2022-04-08 09:48:23,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {13440#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13444#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} is VALID [2022-04-08 09:48:23,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {13444#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13448#(and (= (+ (- 1) main_~i~0) 16) (= 91 (+ (- 28) main_~sum~0 (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:48:23,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {13448#(and (= (+ (- 1) main_~i~0) 16) (= 91 (+ (- 28) main_~sum~0 (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13452#(and (= 91 (+ (- 62) main_~sum~0)) (= main_~i~0 18))} is VALID [2022-04-08 09:48:23,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {13452#(and (= 91 (+ (- 62) main_~sum~0)) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13456#(and (= 91 (+ (* (- 1) main_~i~0) (- 62) main_~sum~0)) (= main_~i~0 18))} is VALID [2022-04-08 09:48:23,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {13456#(and (= 91 (+ (* (- 1) main_~i~0) (- 62) main_~sum~0)) (= main_~i~0 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13460#(and (= 19 main_~i~0) (= 91 (+ (- 80) main_~sum~0)))} is VALID [2022-04-08 09:48:23,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {13460#(and (= 19 main_~i~0) (= 91 (+ (- 80) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13464#(and (= 91 (+ (* (- 1) main_~i~0) (- 80) main_~sum~0)) (= 19 main_~i~0))} is VALID [2022-04-08 09:48:23,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {13464#(and (= 91 (+ (* (- 1) main_~i~0) (- 80) main_~sum~0)) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13468#(and (= 91 (+ (- 79) (* (- 1) main_~i~0) main_~sum~0)) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:48:23,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {13468#(and (= 91 (+ (- 79) (* (- 1) main_~i~0) main_~sum~0)) (= 19 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13472#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:48:23,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {13472#(and (= (+ 170 (* main_~i~0 2)) main_~sum~0) (= 19 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13476#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:48:23,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {13476#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13480#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-08 09:48:23,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {13480#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13484#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} is VALID [2022-04-08 09:48:23,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {13484#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13488#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} is VALID [2022-04-08 09:48:23,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {13488#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13492#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-08 09:48:23,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {13492#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13496#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-08 09:48:23,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {13496#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13500#(and (= 23 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 42)) 210))} is VALID [2022-04-08 09:48:23,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {13500#(and (= 23 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 42)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13504#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:48:23,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {13504#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13508#(and (= main_~i~0 25) (= main_~sum~0 300))} is VALID [2022-04-08 09:48:23,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {13508#(and (= main_~i~0 25) (= main_~sum~0 300))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13512#(and (= main_~i~0 25) (= (+ (* (- 1) main_~i~0) main_~sum~0) 300))} is VALID [2022-04-08 09:48:23,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {13512#(and (= main_~i~0 25) (= (+ (* (- 1) main_~i~0) main_~sum~0) 300))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13516#(and (= main_~i~0 (+ (- 299) main_~sum~0)) (= (+ (- 300) main_~sum~0) 25))} is VALID [2022-04-08 09:48:23,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {13516#(and (= main_~i~0 (+ (- 299) main_~sum~0)) (= (+ (- 300) main_~sum~0) 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13520#(and (= main_~sum~0 (+ 325 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 26))} is VALID [2022-04-08 09:48:23,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {13520#(and (= main_~sum~0 (+ 325 main_~i~0)) (<= main_~i~0 main_~n~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13524#(and (= main_~sum~0 351) (<= main_~i~0 27) (<= 26 main_~n~0))} is VALID [2022-04-08 09:48:23,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {13524#(and (= main_~sum~0 351) (<= main_~i~0 27) (<= 26 main_~n~0))} assume !(~i~0 <= ~n~0); {13528#(and (= main_~sum~0 351) (< main_~n~0 27) (<= 26 main_~n~0))} is VALID [2022-04-08 09:48:23,768 INFO L272 TraceCheckUtils]: 60: Hoare triple {13528#(and (= main_~sum~0 351) (< main_~n~0 27) (<= 26 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:48:23,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:48:23,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {13536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13294#false} is VALID [2022-04-08 09:48:23,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {13294#false} assume !false; {13294#false} is VALID [2022-04-08 09:48:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:48:23,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:48:46,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {13294#false} assume !false; {13294#false} is VALID [2022-04-08 09:48:46,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {13536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13294#false} is VALID [2022-04-08 09:48:46,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:48:46,963 INFO L272 TraceCheckUtils]: 60: Hoare triple {13552#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:48:46,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {13556#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {13552#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:48:46,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {13560#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13556#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:48:46,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13560#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:48:46,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:46,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13568#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:48:47,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {13293#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {13564#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:48:47,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13293#true} is VALID [2022-04-08 09:48:47,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {13293#true} call #t~ret3 := main(); {13293#true} is VALID [2022-04-08 09:48:47,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13293#true} {13293#true} #55#return; {13293#true} is VALID [2022-04-08 09:48:47,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#true} assume true; {13293#true} is VALID [2022-04-08 09:48:47,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {13293#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(9, 2); {13293#true} is VALID [2022-04-08 09:48:47,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {13293#true} call ULTIMATE.init(); {13293#true} is VALID [2022-04-08 09:48:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-08 09:48:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:48:47,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588532913] [2022-04-08 09:48:47,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:48:47,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054946683] [2022-04-08 09:48:47,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054946683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:48:47,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:48:47,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 9] total 63 [2022-04-08 09:48:47,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:48:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939106843] [2022-04-08 09:48:47,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939106843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:48:47,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:48:47,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-08 09:48:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025088840] [2022-04-08 09:48:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:48:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 09:48:47,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:48:47,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:47,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:47,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-08 09:48:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-08 09:48:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3721, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 09:48:47,682 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:58,533 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-08 09:48:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-08 09:48:58,533 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 09:48:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:48:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-08 09:48:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-08 09:48:58,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-08 09:48:58,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:58,716 INFO L225 Difference]: With dead ends: 72 [2022-04-08 09:48:58,716 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 09:48:58,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 26 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=196, Invalid=3964, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 09:48:58,717 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:48:58,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 398 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-08 09:48:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 09:48:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 09:48:58,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:48:58,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,758 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,758 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:58,759 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-08 09:48:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-08 09:48:58,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:58,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:58,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:48:58,760 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 09:48:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:58,760 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-08 09:48:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-08 09:48:58,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:58,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:58,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:48:58,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:48:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-08 09:48:58,761 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-08 09:48:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:48:58,762 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-08 09:48:58,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:58,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-08 09:48:59,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:48:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-08 09:48:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 09:48:59,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:48:59,016 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:48:59,032 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-08 09:48:59,216 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-08 09:48:59,216 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:48:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:48:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 53 times [2022-04-08 09:48:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427190405] [2022-04-08 09:48:59,219 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:48:59,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:48:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 54 times [2022-04-08 09:48:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:48:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084177351] [2022-04-08 09:48:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:48:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:48:59,236 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:48:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362161786] [2022-04-08 09:48:59,236 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:48:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:48:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:48:59,237 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-08 09:48:59,238 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-08 09:48:59,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-08 09:48:59,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:48:59,319 WARN L261 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 09:48:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:48:59,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:49:01,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {14155#true} call ULTIMATE.init(); {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {14155#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(9, 2); {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {14155#true} assume true; {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14155#true} {14155#true} #55#return; {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {14155#true} call #t~ret3 := main(); {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {14155#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14155#true} is VALID [2022-04-08 09:49:01,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {14155#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {14178#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:49:01,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {14178#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14182#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:49:01,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {14182#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14186#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:49:01,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {14186#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14190#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:49:01,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {14190#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14194#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} is VALID [2022-04-08 09:49:01,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {14194#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14198#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} is VALID [2022-04-08 09:49:01,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {14198#(and (= (+ (- 2) main_~i~0) 1) (= main_~sum~0 (+ (- 3) (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14202#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-08 09:49:01,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {14202#(and (= (+ (- 6) (* main_~i~0 3)) main_~sum~0) (= (+ main_~i~0 (- 3)) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14206#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} is VALID [2022-04-08 09:49:01,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {14206#(and (= (+ main_~i~0 (- 3)) 1) (= main_~sum~0 (+ (- 6) (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14210#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:49:01,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {14210#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14214#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:49:01,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {14214#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14218#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:49:01,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {14218#(and (= (+ (- 1) main_~i~0) 5) (= 10 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14222#(and (= (+ (- 1) main_~i~0) 5) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 10))} is VALID [2022-04-08 09:49:01,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {14222#(and (= (+ (- 1) main_~i~0) 5) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14226#(and (= 10 (+ (- 11) main_~sum~0)) (= 7 main_~i~0))} is VALID [2022-04-08 09:49:01,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {14226#(and (= 10 (+ (- 11) main_~sum~0)) (= 7 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14230#(and (= 7 main_~i~0) (= (+ (- 11) (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:49:01,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {14230#(and (= 7 main_~i~0) (= (+ (- 11) (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14234#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 10) (= 7 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:49:01,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {14234#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 10)) 10) (= 7 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14238#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-08 09:49:01,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {14238#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14242#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:49:01,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {14242#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14246#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:49:01,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {14246#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14250#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:49:01,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {14250#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14254#(and (= (+ main_~i~0 (- 3)) 7) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 15 (* main_~i~0 3))))} is VALID [2022-04-08 09:49:01,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {14254#(and (= (+ main_~i~0 (- 3)) 7) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 15 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14258#(and (= (+ (* main_~i~0 3) 12) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:49:01,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {14258#(and (= (+ (* main_~i~0 3) 12) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 7 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14262#(and (= (+ (* main_~i~0 3) 12) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:49:01,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(and (= (+ (* main_~i~0 3) 12) (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= 7 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14266#(and (= (+ 9 (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 5)) 7))} is VALID [2022-04-08 09:49:01,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {14266#(and (= (+ 9 (* main_~i~0 3)) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 5)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14270#(and (= main_~sum~0 (+ (* main_~i~0 6) 6)) (= (+ main_~i~0 (- 5)) 7))} is VALID [2022-04-08 09:49:01,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {14270#(and (= main_~sum~0 (+ (* main_~i~0 6) 6)) (= (+ main_~i~0 (- 5)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14274#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:49:01,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {14274#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14278#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:49:01,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {14278#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14282#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:49:01,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {14282#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14286#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:49:01,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {14286#(and (= main_~sum~0 (+ 91 main_~i~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14290#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:49:01,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {14290#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14294#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-08 09:49:01,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {14294#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14298#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:49:01,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {14298#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14302#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} is VALID [2022-04-08 09:49:01,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {14302#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14306#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-08 09:49:01,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {14306#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14310#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-08 09:49:01,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {14310#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14314#(and (= (+ (* (- 1) main_~i~0) (- 118) main_~sum~0) (+ (- 1) main_~i~0)) (= 16 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-08 09:49:01,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {14314#(and (= (+ (* (- 1) main_~i~0) (- 118) main_~sum~0) (+ (- 1) main_~i~0)) (= 16 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14318#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-08 09:49:01,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {14318#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14322#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:49:01,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {14322#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14326#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:49:01,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {14326#(and (= (+ main_~i~0 (- 3)) 16) (= (+ 114 (* main_~i~0 3)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14330#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-08 09:49:01,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {14330#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14334#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:49:01,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {14334#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14338#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} is VALID [2022-04-08 09:49:01,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {14338#(and (= (+ main_~sum~0 (- 189)) main_~i~0) (= 20 (+ main_~sum~0 (- 190))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14342#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} is VALID [2022-04-08 09:49:01,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {14342#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 190)) 20) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 189)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14346#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} is VALID [2022-04-08 09:49:01,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {14346#(and (= (+ (- 210) main_~sum~0) 21) (= (+ main_~sum~0 (- 209)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14350#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:49:01,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {14350#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14354#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:49:01,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {14354#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14358#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:49:01,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {14358#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14362#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-08 09:49:01,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {14362#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14366#(and (= (+ (* (- 1) main_~i~0) (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-08 09:49:01,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {14366#(and (= (+ (* (- 1) main_~i~0) (- 23) main_~sum~0) 253) (= main_~i~0 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14370#(and (= main_~i~0 25) (= (+ main_~sum~0 (- 47)) 253))} is VALID [2022-04-08 09:49:01,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {14370#(and (= main_~i~0 25) (= (+ main_~sum~0 (- 47)) 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14374#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2022-04-08 09:49:01,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {14374#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14378#(and (= main_~sum~0 (+ main_~i~0 299)) (= (+ (- 1) main_~i~0) 25))} is VALID [2022-04-08 09:49:01,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {14378#(and (= main_~sum~0 (+ main_~i~0 299)) (= (+ (- 1) main_~i~0) 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14382#(and (= main_~sum~0 (+ (* main_~i~0 2) 299)) (= (+ (- 1) main_~i~0) 25))} is VALID [2022-04-08 09:49:01,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {14382#(and (= main_~sum~0 (+ (* main_~i~0 2) 299)) (= (+ (- 1) main_~i~0) 25))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14386#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-08 09:49:01,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {14386#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14390#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:49:01,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {14390#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14394#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (<= main_~i~0 28))} is VALID [2022-04-08 09:49:01,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {14394#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (<= main_~i~0 28))} assume !(~i~0 <= ~n~0); {14398#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (< main_~n~0 28))} is VALID [2022-04-08 09:49:01,615 INFO L272 TraceCheckUtils]: 62: Hoare triple {14398#(and (<= 27 main_~n~0) (= 378 main_~sum~0) (< main_~n~0 28))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:49:01,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:49:01,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {14406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14156#false} is VALID [2022-04-08 09:49:01,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {14156#false} assume !false; {14156#false} is VALID [2022-04-08 09:49:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:49:01,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:49:32,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {14156#false} assume !false; {14156#false} is VALID [2022-04-08 09:49:32,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {14406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14156#false} is VALID [2022-04-08 09:49:32,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:49:32,573 INFO L272 TraceCheckUtils]: 62: Hoare triple {14422#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {14402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:49:32,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {14426#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {14422#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:49:32,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {14430#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14426#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:49:32,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14430#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:49:32,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:32,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:32,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {14438#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:49:33,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {14155#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {14434#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:49:33,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {14155#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14155#true} is VALID [2022-04-08 09:49:33,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {14155#true} call #t~ret3 := main(); {14155#true} is VALID [2022-04-08 09:49:33,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14155#true} {14155#true} #55#return; {14155#true} is VALID [2022-04-08 09:49:33,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {14155#true} assume true; {14155#true} is VALID [2022-04-08 09:49:33,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {14155#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(9, 2); {14155#true} is VALID [2022-04-08 09:49:33,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {14155#true} call ULTIMATE.init(); {14155#true} is VALID [2022-04-08 09:49:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-08 09:49:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:49:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084177351] [2022-04-08 09:49:33,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:49:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362161786] [2022-04-08 09:49:33,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362161786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:49:33,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:49:33,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 9] total 65 [2022-04-08 09:49:33,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:49:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427190405] [2022-04-08 09:49:33,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427190405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:49:33,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:49:33,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-08 09:49:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844615864] [2022-04-08 09:49:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:49:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 09:49:33,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:49:33,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:33,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:49:33,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-08 09:49:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:49:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-08 09:49:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3969, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 09:49:33,337 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:49:46,733 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-08 09:49:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-08 09:49:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 09:49:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:49:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-08 09:49:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-08 09:49:46,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-08 09:49:46,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:49:46,965 INFO L225 Difference]: With dead ends: 74 [2022-04-08 09:49:46,966 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 09:49:46,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 41 SyntacticMatches, 27 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=202, Invalid=4220, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 09:49:46,966 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:49:46,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-04-08 09:49:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 09:49:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 09:49:47,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:49:47,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:47,011 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:49:47,011 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-08 09:49:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-08 09:49:47,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:49:47,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:49:47,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:49:47,012 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 09:49:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:49:47,012 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-08 09:49:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-08 09:49:47,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:49:47,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:49:47,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:49:47,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:49:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-08 09:49:47,013 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-08 09:49:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:49:47,014 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-08 09:49:47,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:47,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-08 09:49:47,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:49:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-08 09:49:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 09:49:47,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:49:47,189 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:49:47,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 09:49:47,390 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-08 09:49:47,390 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:49:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:49:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash -862492579, now seen corresponding path program 55 times [2022-04-08 09:49:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:49:47,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322927971] [2022-04-08 09:49:47,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:49:47,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:49:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash -862492579, now seen corresponding path program 56 times [2022-04-08 09:49:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:49:47,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646237169] [2022-04-08 09:49:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:49:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:49:47,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:49:47,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960408813] [2022-04-08 09:49:47,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:49:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:49:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:49:47,408 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-08 09:49:47,409 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-08 09:49:47,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:49:47,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:49:47,459 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-08 09:49:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:49:47,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:49:50,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {15043#true} call ULTIMATE.init(); {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {15043#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(9, 2); {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {15043#true} assume true; {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15043#true} {15043#true} #55#return; {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {15043#true} call #t~ret3 := main(); {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {15043#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15043#true} is VALID [2022-04-08 09:49:50,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {15043#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15066#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:49:50,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {15066#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15070#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:49:50,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {15070#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15074#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-08 09:49:50,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {15074#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15078#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:49:50,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {15078#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:49:50,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {15082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 1) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15086#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:49:50,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {15086#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15090#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:49:50,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {15090#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15094#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} is VALID [2022-04-08 09:49:50,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {15094#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 6) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15098#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:49:50,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {15098#(and (= 6 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15102#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:49:50,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {15102#(and (= (+ 5 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15106#(and (= main_~i~0 6) (= main_~sum~0 15))} is VALID [2022-04-08 09:49:50,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {15106#(and (= main_~i~0 6) (= main_~sum~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15110#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:49:50,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {15110#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15114#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:49:50,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {15114#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15118#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:49:50,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {15118#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15122#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-08 09:49:50,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {15122#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15126#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 28) (= main_~i~0 8))} is VALID [2022-04-08 09:49:50,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 28) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15130#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:49:50,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {15130#(and (= 8 (+ (- 28) main_~sum~0)) (= (+ (- 27) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15134#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} is VALID [2022-04-08 09:49:50,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {15134#(and (= main_~sum~0 (+ main_~i~0 36)) (= main_~i~0 9))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15138#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} is VALID [2022-04-08 09:49:50,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {15138#(and (= main_~i~0 (+ main_~sum~0 (- 35))) (= (+ main_~sum~0 (- 36)) 9))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15142#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:49:50,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {15142#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15146#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:49:50,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {15146#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15150#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} is VALID [2022-04-08 09:49:50,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 55) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15154#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} is VALID [2022-04-08 09:49:50,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {15154#(and (= main_~i~0 12) (= 55 (+ (- 11) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15158#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:49:50,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15162#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:49:50,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {15162#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15166#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:49:50,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {15166#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15170#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:49:50,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {15170#(and (= 13 (+ main_~sum~0 (- 78))) (= (+ (- 77) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15174#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 78)) 13) (= (+ (* (- 1) main_~i~0) (- 77) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:49:50,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {15174#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 78)) 13) (= (+ (* (- 1) main_~i~0) (- 77) main_~sum~0) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15178#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:49:50,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {15178#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15182#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-08 09:49:50,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {15182#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15186#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:49:50,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {15186#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15190#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:49:50,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {15190#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) 15) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 103))))} is VALID [2022-04-08 09:49:50,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {15194#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) 15) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 (- 103))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15198#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-08 09:49:50,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15202#(and (= 153 main_~sum~0) (= main_~i~0 18))} is VALID [2022-04-08 09:49:50,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#(and (= 153 main_~sum~0) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15206#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} is VALID [2022-04-08 09:49:50,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {15206#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15210#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:49:50,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {15210#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15214#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-08 09:49:50,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {15214#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15218#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} is VALID [2022-04-08 09:49:50,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {15218#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15222#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} is VALID [2022-04-08 09:49:50,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {15222#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15226#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} is VALID [2022-04-08 09:49:50,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {15226#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15230#(and (= main_~i~0 21) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 57))))} is VALID [2022-04-08 09:49:50,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {15230#(and (= main_~i~0 21) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 57))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15234#(and (= main_~i~0 22) (= 153 (+ main_~sum~0 (- 78))))} is VALID [2022-04-08 09:49:50,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {15234#(and (= main_~i~0 22) (= 153 (+ main_~sum~0 (- 78))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15238#(and (= main_~i~0 22) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 78))))} is VALID [2022-04-08 09:49:50,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {15238#(and (= main_~i~0 22) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 78))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15242#(and (= (+ (- 1) main_~i~0) 22) (= 153 (+ (* (- 1) main_~i~0) (- 77) main_~sum~0)))} is VALID [2022-04-08 09:49:50,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {15242#(and (= (+ (- 1) main_~i~0) 22) (= 153 (+ (* (- 1) main_~i~0) (- 77) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15246#(and (= (+ (* main_~i~0 2) 230) main_~sum~0) (= (+ (- 1) main_~i~0) 22))} is VALID [2022-04-08 09:49:50,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {15246#(and (= (+ (* main_~i~0 2) 230) main_~sum~0) (= (+ (- 1) main_~i~0) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15250#(and (= 22 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 228 (* main_~i~0 2))))} is VALID [2022-04-08 09:49:50,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {15250#(and (= 22 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 228 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15254#(and (= 22 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 228 (* main_~i~0 2))))} is VALID [2022-04-08 09:49:50,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {15254#(and (= 22 (+ (- 2) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 228 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15258#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} is VALID [2022-04-08 09:49:50,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {15258#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15262#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} is VALID [2022-04-08 09:49:50,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {15262#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 226)) (= (+ main_~i~0 (- 3)) 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15266#(and (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 224 (* main_~i~0 2))) (= 22 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:49:50,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {15266#(and (= (+ main_~sum~0 3 (* (- 2) main_~i~0)) (+ 224 (* main_~i~0 2))) (= 22 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15270#(and (= (+ 224 (* main_~i~0 2)) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= 22 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:49:50,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {15270#(and (= (+ 224 (* main_~i~0 2)) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= 22 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15274#(and (= main_~i~0 27) (= (+ main_~sum~0 (- 75)) 276))} is VALID [2022-04-08 09:49:50,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {15274#(and (= main_~i~0 27) (= (+ main_~sum~0 (- 75)) 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15278#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 75)) 276))} is VALID [2022-04-08 09:49:50,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {15278#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 75)) 276))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15282#(and (= 276 (+ (- 102) main_~sum~0)) (= main_~i~0 28))} is VALID [2022-04-08 09:49:50,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {15282#(and (= 276 (+ (- 102) main_~sum~0)) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15286#(and (<= main_~i~0 main_~n~0) (= 276 (+ (- 102) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 28))} is VALID [2022-04-08 09:49:50,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {15286#(and (<= main_~i~0 main_~n~0) (= 276 (+ (- 102) (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15290#(and (= (+ (- 378) main_~sum~0) 28) (<= (+ main_~i~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} is VALID [2022-04-08 09:49:50,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {15290#(and (= (+ (- 378) main_~sum~0) 28) (<= (+ main_~i~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} assume !(~i~0 <= ~n~0); {15294#(and (= (+ (- 378) main_~sum~0) 28) (< (+ main_~n~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} is VALID [2022-04-08 09:49:50,651 INFO L272 TraceCheckUtils]: 64: Hoare triple {15294#(and (= (+ (- 378) main_~sum~0) 28) (< (+ main_~n~0 377) main_~sum~0) (<= main_~sum~0 (+ 378 main_~n~0)))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:49:50,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:49:50,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {15302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15044#false} is VALID [2022-04-08 09:49:50,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {15044#false} assume !false; {15044#false} is VALID [2022-04-08 09:49:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:49:50,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:50:29,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {15044#false} assume !false; {15044#false} is VALID [2022-04-08 09:50:29,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {15302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15044#false} is VALID [2022-04-08 09:50:29,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:50:29,739 INFO L272 TraceCheckUtils]: 64: Hoare triple {15318#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {15298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:50:29,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {15322#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {15318#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:50:29,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {15326#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15322#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:50:29,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15326#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:50:29,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:29,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:29,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15334#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:50:30,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {15043#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15330#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:50:30,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {15043#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15043#true} is VALID [2022-04-08 09:50:30,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {15043#true} call #t~ret3 := main(); {15043#true} is VALID [2022-04-08 09:50:30,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15043#true} {15043#true} #55#return; {15043#true} is VALID [2022-04-08 09:50:30,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {15043#true} assume true; {15043#true} is VALID [2022-04-08 09:50:30,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {15043#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(9, 2); {15043#true} is VALID [2022-04-08 09:50:30,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {15043#true} call ULTIMATE.init(); {15043#true} is VALID [2022-04-08 09:50:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-08 09:50:30,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:50:30,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646237169] [2022-04-08 09:50:30,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:50:30,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960408813] [2022-04-08 09:50:30,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960408813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:50:30,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:50:30,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 9] total 67 [2022-04-08 09:50:30,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:50:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322927971] [2022-04-08 09:50:30,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322927971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:50:30,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:50:30,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-08 09:50:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910786057] [2022-04-08 09:50:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:50:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 09:50:30,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:50:30,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:30,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:50:30,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-08 09:50:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:50:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-08 09:50:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4225, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 09:50:30,627 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:55,237 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-08 09:50:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-08 09:50:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 09:50:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:50:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-08 09:50:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-08 09:50:55,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-08 09:50:55,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:50:55,597 INFO L225 Difference]: With dead ends: 76 [2022-04-08 09:50:55,597 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 09:50:55,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 42 SyntacticMatches, 28 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=208, Invalid=4484, Unknown=0, NotChecked=0, Total=4692 [2022-04-08 09:50:55,598 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:50:55,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 433 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2022-04-08 09:50:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 09:50:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 09:50:55,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:50:55,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,645 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,645 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:55,646 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-08 09:50:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-08 09:50:55,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:50:55,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:50:55,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 09:50:55,646 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 09:50:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:55,647 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-08 09:50:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-08 09:50:55,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:50:55,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:50:55,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:50:55,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:50:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-08 09:50:55,648 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-08 09:50:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:50:55,648 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-08 09:50:55,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:55,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-08 09:50:55,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:50:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-08 09:50:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 09:50:55,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:50:55,935 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:50:55,952 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-08 09:50:56,151 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-08 09:50:56,152 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:50:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:50:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 57 times [2022-04-08 09:50:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:50:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211741131] [2022-04-08 09:50:56,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:50:56,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:50:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 58 times [2022-04-08 09:50:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:50:56,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991284255] [2022-04-08 09:50:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:50:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:50:56,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:50:56,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118931414] [2022-04-08 09:50:56,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:50:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:50:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:50:56,181 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-08 09:50:56,181 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-08 09:50:56,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:50:56,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:50:56,238 WARN L261 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 124 conjunts are in the unsatisfiable core [2022-04-08 09:50:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:50:56,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:51:00,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {15957#true} call ULTIMATE.init(); {15957#true} is VALID [2022-04-08 09:51:00,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {15957#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(9, 2); {15957#true} is VALID [2022-04-08 09:51:00,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {15957#true} assume true; {15957#true} is VALID [2022-04-08 09:51:00,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15957#true} {15957#true} #55#return; {15957#true} is VALID [2022-04-08 09:51:00,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {15957#true} call #t~ret3 := main(); {15957#true} is VALID [2022-04-08 09:51:00,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {15957#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15957#true} is VALID [2022-04-08 09:51:00,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {15957#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {15980#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:51:00,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {15980#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15984#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:51:00,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {15984#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15988#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2022-04-08 09:51:00,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {15988#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {15992#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} is VALID [2022-04-08 09:51:00,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {15992#(and (= main_~i~0 2) (= (+ (* (- 1) main_~i~0) main_~sum~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15996#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-08 09:51:00,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {15996#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16000#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:51:00,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {16000#(and (= main_~sum~0 (* main_~i~0 2)) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16004#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {16004#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16008#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {16008#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 2) (* main_~i~0 2))) (= 2 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16012#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} is VALID [2022-04-08 09:51:00,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {16012#(and (= 5 main_~i~0) (= (+ main_~sum~0 (- 4)) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16016#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} is VALID [2022-04-08 09:51:00,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {16016#(and (= main_~sum~0 (+ main_~i~0 10)) (= 5 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16020#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:51:00,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {16020#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16024#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:51:00,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {16024#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16028#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:51:00,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {16028#(and (= (+ main_~i~0 14) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16032#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} is VALID [2022-04-08 09:51:00,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {16032#(and (= (+ 14 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16036#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2022-04-08 09:51:00,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {16036#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16040#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} is VALID [2022-04-08 09:51:00,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {16040#(and (= (+ main_~i~0 28) main_~sum~0) (= main_~i~0 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16044#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:51:00,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {16044#(and (= (+ main_~i~0 27) main_~sum~0) (= (+ (- 1) main_~i~0) 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16048#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} is VALID [2022-04-08 09:51:00,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {16048#(and (= main_~sum~0 (+ (* main_~i~0 2) 27)) (= (+ (- 1) main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16052#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {16052#(and (= main_~sum~0 (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16056#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {16056#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 2) 25)) (= 8 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16060#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:51:00,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {16060#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16064#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-08 09:51:00,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {16064#(and (= (+ main_~i~0 (- 3)) 8) (= (+ 23 (* main_~i~0 2)) (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16068#(and (= 8 (+ main_~i~0 (- 4))) (= (+ 21 (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:51:00,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {16068#(and (= 8 (+ main_~i~0 (- 4))) (= (+ 21 (* main_~i~0 2)) (+ main_~sum~0 3 (* (- 2) main_~i~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16072#(and (= 8 (+ main_~i~0 (- 4))) (= (+ (* 5 main_~i~0) 18) main_~sum~0))} is VALID [2022-04-08 09:51:00,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {16072#(and (= 8 (+ main_~i~0 (- 4))) (= (+ (* 5 main_~i~0) 18) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16076#(and (= (+ main_~i~0 (- 5)) 8) (= main_~sum~0 (+ (* 5 main_~i~0) 13)))} is VALID [2022-04-08 09:51:00,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {16076#(and (= (+ main_~i~0 (- 5)) 8) (= main_~sum~0 (+ (* 5 main_~i~0) 13)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16080#(and (= (+ main_~i~0 (- 5)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* 5 main_~i~0) 13)))} is VALID [2022-04-08 09:51:00,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {16080#(and (= (+ main_~i~0 (- 5)) 8) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* 5 main_~i~0) 13)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16084#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:51:00,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16088#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:51:00,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {16088#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16092#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:51:00,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {16092#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16096#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} is VALID [2022-04-08 09:51:00,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {16096#(and (= 14 (+ (* (- 1) main_~i~0) main_~sum~0 (- 91))) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 90))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16100#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:51:00,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {16100#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:51:00,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {16104#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16108#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-08 09:51:00,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {16108#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16112#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-08 09:51:00,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {16112#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16116#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:51:00,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {16116#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16120#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} is VALID [2022-04-08 09:51:00,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#(and (= 16 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 117 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16124#(and (= 19 main_~i~0) (= main_~sum~0 171))} is VALID [2022-04-08 09:51:00,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {16124#(and (= 19 main_~i~0) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16128#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} is VALID [2022-04-08 09:51:00,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {16128#(and (= (+ 171 main_~i~0) main_~sum~0) (= 19 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16132#(and (= main_~i~0 20) (= 190 main_~sum~0))} is VALID [2022-04-08 09:51:00,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {16132#(and (= main_~i~0 20) (= 190 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16136#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:51:00,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16140#(and (= main_~sum~0 (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} is VALID [2022-04-08 09:51:00,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {16140#(and (= main_~sum~0 (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16144#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} is VALID [2022-04-08 09:51:00,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {16144#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 189)) (= (+ (- 1) main_~i~0) 20))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16148#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} is VALID [2022-04-08 09:51:00,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {16148#(and (= main_~i~0 22) (= (+ main_~sum~0 (- 21)) 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16152#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} is VALID [2022-04-08 09:51:00,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {16152#(and (= main_~i~0 22) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 21)) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16156#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-08 09:51:00,290 INFO L290 TraceCheckUtils]: 51: Hoare triple {16156#(and (= (+ main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16160#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} is VALID [2022-04-08 09:51:00,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {16160#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 43)) 210) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16164#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} is VALID [2022-04-08 09:51:00,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16168#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:51:00,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {16168#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16172#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {16172#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16176#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:51:00,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {16176#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16180#(and (= (+ main_~sum~0 (- 25)) 300) (= main_~i~0 26))} is VALID [2022-04-08 09:51:00,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {16180#(and (= (+ main_~sum~0 (- 25)) 300) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16184#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 25)) 300) (= main_~i~0 26))} is VALID [2022-04-08 09:51:00,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {16184#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 25)) 300) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16188#(and (= (+ main_~sum~0 (- 325)) 26) (= (+ (- 324) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:51:00,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {16188#(and (= (+ main_~sum~0 (- 325)) 26) (= (+ (- 324) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16192#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} is VALID [2022-04-08 09:51:00,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16196#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} is VALID [2022-04-08 09:51:00,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {16196#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16200#(and (= (+ (* (- 1) main_~i~0) (- 351) main_~sum~0) 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) main_~i~0))} is VALID [2022-04-08 09:51:00,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {16200#(and (= (+ (* (- 1) main_~i~0) (- 351) main_~sum~0) 27) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16204#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) 27) (= (+ (- 1) main_~i~0) (+ (- 349) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:51:00,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {16204#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 350)) 27) (= (+ (- 1) main_~i~0) (+ (- 349) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16208#(and (= (+ (- 1) main_~i~0) (+ (- 349) main_~sum~0 (* (- 2) main_~i~0))) (<= main_~i~0 main_~n~0) (= 27 (+ main_~sum~0 (- 350) (* (- 2) main_~i~0))))} is VALID [2022-04-08 09:51:00,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {16208#(and (= (+ (- 1) main_~i~0) (+ (- 349) main_~sum~0 (* (- 2) main_~i~0))) (<= main_~i~0 main_~n~0) (= 27 (+ main_~sum~0 (- 350) (* (- 2) main_~i~0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16212#(and (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (<= main_~i~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} is VALID [2022-04-08 09:51:00,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {16212#(and (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (<= main_~i~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} assume !(~i~0 <= ~n~0); {16216#(and (< main_~n~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} is VALID [2022-04-08 09:51:00,312 INFO L272 TraceCheckUtils]: 66: Hoare triple {16216#(and (< main_~n~0 (+ (div (+ (- 348) main_~sum~0) 3) 1)) (<= (div (+ (- 348) main_~sum~0) 3) main_~n~0) (= (mod main_~sum~0 3) 0) (= (+ (* (- 2) (div (+ (- 348) main_~sum~0) 3)) main_~sum~0 (- 350)) 27))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:51:00,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:51:00,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {16224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15958#false} is VALID [2022-04-08 09:51:00,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {15958#false} assume !false; {15958#false} is VALID [2022-04-08 09:51:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:51:00,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:51:46,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {15958#false} assume !false; {15958#false} is VALID [2022-04-08 09:51:46,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {16224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15958#false} is VALID [2022-04-08 09:51:46,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:51:46,116 INFO L272 TraceCheckUtils]: 66: Hoare triple {16240#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {16220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:51:46,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {16244#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {16240#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:51:46,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {16248#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16244#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:51:46,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16248#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:51:46,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,189 INFO L290 TraceCheckUtils]: 59: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16256#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:51:46,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {15957#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {16252#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:51:46,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {15957#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15957#true} is VALID [2022-04-08 09:51:46,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {15957#true} call #t~ret3 := main(); {15957#true} is VALID [2022-04-08 09:51:46,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15957#true} {15957#true} #55#return; {15957#true} is VALID [2022-04-08 09:51:46,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {15957#true} assume true; {15957#true} is VALID [2022-04-08 09:51:46,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {15957#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(9, 2); {15957#true} is VALID [2022-04-08 09:51:46,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {15957#true} call ULTIMATE.init(); {15957#true} is VALID [2022-04-08 09:51:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-08 09:51:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:51:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991284255] [2022-04-08 09:51:46,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:51:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118931414] [2022-04-08 09:51:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118931414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:51:46,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:51:46,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 9] total 69 [2022-04-08 09:51:46,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:51:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211741131] [2022-04-08 09:51:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211741131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:46,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:46,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-08 09:51:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130748605] [2022-04-08 09:51:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:51:46,918 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-08 09:51:46,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:51:46,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:51:47,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:47,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-08 09:51:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-08 09:51:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4489, Unknown=0, NotChecked=0, Total=4692 [2022-04-08 09:51:47,264 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:09,645 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-08 09:52:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-08 09:52:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-08 09:52:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:52:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-08 09:52:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-08 09:52:09,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-08 09:52:09,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:09,957 INFO L225 Difference]: With dead ends: 78 [2022-04-08 09:52:09,957 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 09:52:09,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 43 SyntacticMatches, 29 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=214, Invalid=4756, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 09:52:09,958 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:52:09,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 447 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3966 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2022-04-08 09:52:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 09:52:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 09:52:10,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:52:10,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:10,014 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:10,014 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:10,016 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-08 09:52:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-08 09:52:10,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:10,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:10,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 09:52:10,016 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-08 09:52:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:10,017 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-08 09:52:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-08 09:52:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:10,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:10,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:52:10,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:52:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-08 09:52:10,018 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-08 09:52:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:52:10,018 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-08 09:52:10,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:10,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-08 09:52:10,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-08 09:52:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 09:52:10,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:52:10,336 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:52:10,352 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-08 09:52:10,536 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-08 09:52:10,536 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:52:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:52:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1003499033, now seen corresponding path program 59 times [2022-04-08 09:52:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:52:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372356593] [2022-04-08 09:52:10,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:52:10,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:52:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1003499033, now seen corresponding path program 60 times [2022-04-08 09:52:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:52:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717891976] [2022-04-08 09:52:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:52:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:52:10,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:52:10,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578955967] [2022-04-08 09:52:10,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:52:10,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:52:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:52:10,572 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-08 09:52:10,573 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-08 09:52:10,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-08 09:52:10,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:52:10,639 WARN L261 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-08 09:52:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:10,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:52:14,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {16897#true} call ULTIMATE.init(); {16897#true} is VALID [2022-04-08 09:52:14,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {16897#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(9, 2); {16897#true} is VALID [2022-04-08 09:52:14,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {16897#true} assume true; {16897#true} is VALID [2022-04-08 09:52:14,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16897#true} {16897#true} #55#return; {16897#true} is VALID [2022-04-08 09:52:14,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {16897#true} call #t~ret3 := main(); {16897#true} is VALID [2022-04-08 09:52:14,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {16897#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16897#true} is VALID [2022-04-08 09:52:14,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {16897#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {16920#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:52:14,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {16920#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16924#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:52:14,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {16924#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16928#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:52:14,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {16928#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 0) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16932#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:52:14,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {16932#(and (= main_~sum~0 (+ (- 1) (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16936#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-08 09:52:14,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {16936#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16940#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} is VALID [2022-04-08 09:52:14,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {16940#(and (= main_~i~0 3) (= (+ (* (- 1) main_~i~0) main_~sum~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16944#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:52:14,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {16944#(and (= 3 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16948#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} is VALID [2022-04-08 09:52:14,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {16948#(and (= main_~sum~0 (+ 2 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16952#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:52:14,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {16952#(and (= main_~sum~0 (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16956#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:52:14,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {16956#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (* main_~i~0 2)) (= 3 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16960#(and (= (+ main_~i~0 (- 3)) 3) (= (+ (- 2) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:52:14,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {16960#(and (= (+ main_~i~0 (- 3)) 3) (= (+ (- 2) (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16964#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} is VALID [2022-04-08 09:52:14,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {16964#(and (= main_~sum~0 (+ (- 3) (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16968#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:52:14,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {16968#(and (= main_~sum~0 (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16972#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:52:14,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {16972#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 7) (* main_~i~0 4))) (= 3 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16976#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (- 11) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:52:14,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {16976#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (- 11) (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16980#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (* main_~i~0 6) (- 12)) main_~sum~0))} is VALID [2022-04-08 09:52:14,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {16980#(and (= (+ main_~i~0 (- 5)) 3) (= (+ (* main_~i~0 6) (- 12)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16984#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} is VALID [2022-04-08 09:52:14,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {16984#(and (= main_~sum~0 (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} is VALID [2022-04-08 09:52:14,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {16988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (* main_~i~0 6) (- 18))) (= (+ main_~i~0 (- 6)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16992#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} is VALID [2022-04-08 09:52:14,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {16992#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {16996#(and (= main_~i~0 10) (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 36))} is VALID [2022-04-08 09:52:14,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {16996#(and (= main_~i~0 10) (= (+ (- 9) (* (- 1) main_~i~0) main_~sum~0) 36))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17000#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-08 09:52:14,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {17000#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17004#(and (= (+ (- 1) main_~i~0) 10) (= main_~sum~0 (+ 44 (* main_~i~0 2))))} is VALID [2022-04-08 09:52:14,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {17004#(and (= (+ (- 1) main_~i~0) 10) (= main_~sum~0 (+ 44 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17008#(and (= (+ 42 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 10))} is VALID [2022-04-08 09:52:14,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {17008#(and (= (+ 42 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17012#(and (= main_~sum~0 (+ 42 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 10))} is VALID [2022-04-08 09:52:14,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {17012#(and (= main_~sum~0 (+ 42 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17016#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2022-04-08 09:52:14,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {17016#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 78) (= main_~i~0 13))} is VALID [2022-04-08 09:52:14,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {17020#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 78) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17024#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:52:14,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {17024#(and (= (+ (- 13) main_~sum~0) 78) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17028#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} is VALID [2022-04-08 09:52:14,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {17028#(and (= (+ (* (- 1) main_~i~0) (- 13) main_~sum~0) 78) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17032#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} is VALID [2022-04-08 09:52:14,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {17032#(and (= 14 (+ main_~sum~0 (- 91))) (= (+ main_~sum~0 (- 90)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17036#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} is VALID [2022-04-08 09:52:14,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {17036#(and (= main_~i~0 15) (= main_~sum~0 (+ main_~i~0 105)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17040#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:52:14,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {17040#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17044#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} is VALID [2022-04-08 09:52:14,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {17044#(and (= main_~i~0 16) (= (+ main_~i~0 120) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17048#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} is VALID [2022-04-08 09:52:14,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {17048#(and (= main_~i~0 (+ main_~sum~0 (- 119))) (= 16 (+ (- 120) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17052#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} is VALID [2022-04-08 09:52:14,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {17052#(and (= (+ (* (- 1) main_~i~0) (- 120) main_~sum~0) 16) (= main_~i~0 (+ (* (- 1) main_~i~0) main_~sum~0 (- 119))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17056#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} is VALID [2022-04-08 09:52:14,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {17056#(and (= (+ main_~sum~0 (- 136)) 17) (= main_~i~0 (+ main_~sum~0 (- 135))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17060#(and (= main_~sum~0 (+ 153 main_~i~0)) (= main_~i~0 18))} is VALID [2022-04-08 09:52:14,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {17060#(and (= main_~sum~0 (+ 153 main_~i~0)) (= main_~i~0 18))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17064#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 main_~i~0)))} is VALID [2022-04-08 09:52:14,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {17064#(and (= (+ (- 1) main_~i~0) 18) (= main_~sum~0 (+ 152 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17068#(and (= (+ (- 1) main_~i~0) 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 152 main_~i~0)))} is VALID [2022-04-08 09:52:14,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {17068#(and (= (+ (- 1) main_~i~0) 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 152 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17072#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} is VALID [2022-04-08 09:52:14,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {17072#(and (= main_~i~0 20) (= 171 (+ main_~sum~0 (- 19))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17076#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:52:14,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {17076#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17080#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:52:14,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {17080#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17084#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} is VALID [2022-04-08 09:52:14,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {17084#(and (= main_~i~0 21) (= (+ (* (- 1) main_~i~0) main_~sum~0) 210))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 210) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:52:14,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {17088#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 210) (= (+ (- 1) main_~i~0) 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17092#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:52:14,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {17092#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17096#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:52:14,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {17096#(and (= main_~sum~0 (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17100#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:52:14,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {17100#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 207 (* main_~i~0 2))) (= 21 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17104#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} is VALID [2022-04-08 09:52:14,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {17104#(and (= (+ (- 23) main_~sum~0) 253) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17108#(and (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} is VALID [2022-04-08 09:52:14,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {17108#(and (= main_~i~0 24) (= main_~sum~0 (+ 276 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17112#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:52:14,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {17112#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17116#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:52:14,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {17116#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17120#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:52:14,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {17120#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17124#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:52:14,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {17124#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17128#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-08 09:52:14,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {17128#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17132#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0) 351))} is VALID [2022-04-08 09:52:14,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {17132#(and (= main_~i~0 27) (= (+ (* (- 1) main_~i~0) main_~sum~0) 351))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17136#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} is VALID [2022-04-08 09:52:14,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {17136#(and (= (+ main_~sum~0 (- 350)) main_~i~0) (= 27 (+ (- 351) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17140#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} is VALID [2022-04-08 09:52:14,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {17140#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17144#(and (= 29 main_~i~0) (= main_~sum~0 406))} is VALID [2022-04-08 09:52:14,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {17144#(and (= 29 main_~i~0) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17148#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} is VALID [2022-04-08 09:52:14,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {17148#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17152#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} is VALID [2022-04-08 09:52:14,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {17152#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17156#(and (= (+ (- 1) main_~i~0) 29) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 405 main_~i~0)) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:52:14,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {17156#(and (= (+ (- 1) main_~i~0) 29) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 405 main_~i~0)) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17160#(and (<= main_~i~0 31) (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0))} is VALID [2022-04-08 09:52:14,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {17160#(and (<= main_~i~0 31) (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0))} assume !(~i~0 <= ~n~0); {17164#(and (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0) (< main_~n~0 31))} is VALID [2022-04-08 09:52:14,379 INFO L272 TraceCheckUtils]: 68: Hoare triple {17164#(and (= 435 (+ main_~sum~0 (- 30))) (<= 30 main_~n~0) (< main_~n~0 31))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:52:14,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:52:14,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16898#false} is VALID [2022-04-08 09:52:14,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {16898#false} assume !false; {16898#false} is VALID [2022-04-08 09:52:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:52:14,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:53:11,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {16898#false} assume !false; {16898#false} is VALID [2022-04-08 09:53:11,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {17172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16898#false} is VALID [2022-04-08 09:53:11,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:53:11,342 INFO L272 TraceCheckUtils]: 68: Hoare triple {17188#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {17168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:53:11,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {17192#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {17188#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:53:11,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {17196#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17192#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:53:11,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17196#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:53:11,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:11,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:11,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17204#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:53:12,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {16897#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {17200#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:53:12,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {16897#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16897#true} is VALID [2022-04-08 09:53:12,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {16897#true} call #t~ret3 := main(); {16897#true} is VALID [2022-04-08 09:53:12,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16897#true} {16897#true} #55#return; {16897#true} is VALID [2022-04-08 09:53:12,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {16897#true} assume true; {16897#true} is VALID [2022-04-08 09:53:12,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {16897#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(9, 2); {16897#true} is VALID [2022-04-08 09:53:12,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {16897#true} call ULTIMATE.init(); {16897#true} is VALID [2022-04-08 09:53:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-08 09:53:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:53:12,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717891976] [2022-04-08 09:53:12,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:53:12,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578955967] [2022-04-08 09:53:12,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578955967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:53:12,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:53:12,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 9] total 71 [2022-04-08 09:53:12,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:53:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372356593] [2022-04-08 09:53:12,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372356593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:12,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:12,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-08 09:53:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258239986] [2022-04-08 09:53:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:53:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-08 09:53:12,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:53:12,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:12,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:12,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-08 09:53:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-08 09:53:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4761, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 09:53:12,576 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:41,537 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-08 09:53:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-08 09:53:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-08 09:53:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:53:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-08 09:53:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-08 09:53:41,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-08 09:53:42,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:42,007 INFO L225 Difference]: With dead ends: 80 [2022-04-08 09:53:42,007 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 09:53:42,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 44 SyntacticMatches, 30 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=220, Invalid=5036, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 09:53:42,008 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:53:42,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-04-08 09:53:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 09:53:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-08 09:53:42,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:53:42,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:42,058 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:42,058 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:42,058 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-08 09:53:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-08 09:53:42,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:42,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:42,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:53:42,059 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-08 09:53:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:42,060 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-08 09:53:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-08 09:53:42,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:42,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:42,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:53:42,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:53:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-08 09:53:42,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-08 09:53:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:53:42,061 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-08 09:53:42,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:42,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-08 09:53:42,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-08 09:53:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 09:53:42,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:53:42,581 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:53:42,600 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-08 09:53:42,782 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-08 09:53:42,782 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:53:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:53:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 61 times [2022-04-08 09:53:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:42,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201758684] [2022-04-08 09:53:42,785 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:53:42,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:53:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 62 times [2022-04-08 09:53:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:53:42,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656405785] [2022-04-08 09:53:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:53:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:53:42,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:53:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226579839] [2022-04-08 09:53:42,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:53:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:53:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:53:42,804 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-08 09:53:42,824 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-08 09:53:42,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:53:42,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:53:42,862 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-08 09:53:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:42,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:53:54,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {17863#true} call ULTIMATE.init(); {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {17863#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(9, 2); {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {17863#true} assume true; {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17863#true} {17863#true} #55#return; {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {17863#true} call #t~ret3 := main(); {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {17863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17863#true} is VALID [2022-04-08 09:53:54,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {17886#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:53:54,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {17886#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17890#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2022-04-08 09:53:54,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {17890#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17894#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} is VALID [2022-04-08 09:53:54,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {17894#(and (= (+ (- 1) main_~i~0) 1) (= (+ (- 1) main_~i~0) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17898#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-08 09:53:54,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {17898#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ (- 1) main_~i~0)) (= (+ (- 1) main_~i~0) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17902#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} is VALID [2022-04-08 09:53:54,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {17902#(and (= main_~i~0 3) (= (+ (- 2) main_~sum~0) 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17906#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-08 09:53:54,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {17906#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17910#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:53:54,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {17910#(and (= (+ main_~sum~0 (- 3)) 3) (= (+ (- 2) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17914#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} is VALID [2022-04-08 09:53:54,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#(and (= (+ (* (- 1) main_~i~0) (- 2) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 3)) 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17918#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} is VALID [2022-04-08 09:53:54,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {17918#(and (= (+ main_~sum~0 (- 6)) 4) (= main_~i~0 (+ main_~sum~0 (- 5))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17922#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} is VALID [2022-04-08 09:53:54,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {17922#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 6)) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17926#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} is VALID [2022-04-08 09:53:54,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {17926#(and (= 5 (+ main_~sum~0 (- 10))) (= main_~i~0 (+ (- 9) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17930#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} is VALID [2022-04-08 09:53:54,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {17930#(and (= main_~sum~0 (+ main_~i~0 15)) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17934#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:53:54,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {17934#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17938#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} is VALID [2022-04-08 09:53:54,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {17938#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17942#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} is VALID [2022-04-08 09:53:54,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {17942#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17946#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-08 09:53:54,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {17946#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17950#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:53:54,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {17950#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17954#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 18 (* main_~i~0 2))) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:53:54,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {17954#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 18 (* main_~i~0 2))) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17958#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} is VALID [2022-04-08 09:53:54,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {17958#(and (= main_~i~0 10) (= (+ (- 9) main_~sum~0) 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17962#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} is VALID [2022-04-08 09:53:54,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {17962#(and (= (+ main_~i~0 45) main_~sum~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17966#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} is VALID [2022-04-08 09:53:54,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {17966#(and (= (+ main_~sum~0 (- 44)) main_~i~0) (= (+ (- 45) main_~sum~0) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17970#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-08 09:53:54,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {17970#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17974#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:53:54,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {17974#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17978#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} is VALID [2022-04-08 09:53:54,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {17978#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17982#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) 11) (= (+ (- 1) main_~i~0) (+ (- 53) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:53:54,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {17982#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) 11) (= (+ (- 1) main_~i~0) (+ (- 53) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17986#(and (= (+ (- 1) main_~i~0) (+ (- 53) main_~sum~0 (* (- 2) main_~i~0))) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 54)) 11))} is VALID [2022-04-08 09:53:54,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {17986#(and (= (+ (- 1) main_~i~0) (+ (- 53) main_~sum~0 (* (- 2) main_~i~0))) (= (+ main_~sum~0 (* (- 2) main_~i~0) (- 54)) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17990#(and (= (+ main_~sum~0 (- 52) (* (- 2) main_~i~0)) 11) (= (+ (- 51) main_~sum~0 (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:53:54,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {17990#(and (= (+ main_~sum~0 (- 52) (* (- 2) main_~i~0)) 11) (= (+ (- 51) main_~sum~0 (* (- 2) main_~i~0)) (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {17994#(and (= (+ main_~i~0 (- 3)) 11) (= main_~sum~0 (+ 49 (* main_~i~0 4))))} is VALID [2022-04-08 09:53:54,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {17994#(and (= (+ main_~i~0 (- 3)) 11) (= main_~sum~0 (+ 49 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17998#(and (= main_~i~0 15) (= main_~sum~0 105))} is VALID [2022-04-08 09:53:54,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {17998#(and (= main_~i~0 15) (= main_~sum~0 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18002#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-08 09:53:54,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {18002#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18006#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} is VALID [2022-04-08 09:53:54,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {18006#(and (= (+ main_~sum~0 (- 104)) main_~i~0) (= 15 (+ (- 105) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18010#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-08 09:53:54,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {18010#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18014#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:53:54,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {18014#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18018#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:53:54,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {18018#(and (= 15 (+ (- 2) main_~i~0)) (= (+ 102 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18022#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} is VALID [2022-04-08 09:53:54,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {18022#(and (= (+ (* main_~i~0 2) 100) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 3)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18026#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} is VALID [2022-04-08 09:53:54,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {18026#(and (= (+ main_~i~0 (- 3)) 15) (= main_~sum~0 (+ 99 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18030#(and (= 15 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 95 (* main_~i~0 4))))} is VALID [2022-04-08 09:53:54,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {18030#(and (= 15 (+ main_~i~0 (- 4))) (= main_~sum~0 (+ 95 (* main_~i~0 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18034#(and (= 15 (+ main_~i~0 (- 4))) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 95 (* main_~i~0 4))))} is VALID [2022-04-08 09:53:54,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {18034#(and (= 15 (+ main_~i~0 (- 4))) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 95 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18038#(and (= (+ 91 (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 5)) 15))} is VALID [2022-04-08 09:53:54,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {18038#(and (= (+ 91 (* main_~i~0 4)) (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ main_~i~0 (- 5)) 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18042#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 91 (* main_~i~0 4))) (= (+ main_~i~0 (- 5)) 15))} is VALID [2022-04-08 09:53:54,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {18042#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 91 (* main_~i~0 4))) (= (+ main_~i~0 (- 5)) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18046#(and (= main_~i~0 21) (= 171 (+ main_~sum~0 (- 39))))} is VALID [2022-04-08 09:53:54,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {18046#(and (= main_~i~0 21) (= 171 (+ main_~sum~0 (- 39))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18050#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-08 09:53:54,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {18050#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18054#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:53:54,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {18054#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18058#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:53:54,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {18058#(and (= (+ 209 (* main_~i~0 2)) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18062#(and (= 23 main_~i~0) (= main_~sum~0 253))} is VALID [2022-04-08 09:53:54,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {18062#(and (= 23 main_~i~0) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18066#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} is VALID [2022-04-08 09:53:54,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {18066#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18070#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} is VALID [2022-04-08 09:53:54,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {18070#(and (= 23 (+ (- 253) main_~sum~0)) (= main_~i~0 (+ main_~sum~0 (- 252))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18074#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 252)) main_~i~0) (= (+ (* (- 1) main_~i~0) (- 253) main_~sum~0) 23))} is VALID [2022-04-08 09:53:54,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {18074#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 252)) main_~i~0) (= (+ (* (- 1) main_~i~0) (- 253) main_~sum~0) 23))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18078#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:53:54,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {18078#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18082#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:53:54,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {18082#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 276)) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18086#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:53:54,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {18086#(and (= (+ (* (- 1) main_~i~0) (- 275) main_~sum~0) 24) (= (+ (- 1) main_~i~0) (+ (- 274) (* (- 1) main_~i~0) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18090#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} is VALID [2022-04-08 09:53:54,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {18090#(and (= (+ (- 2) main_~i~0) 24) (= (+ 273 (* main_~i~0 3)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18094#(and (= main_~sum~0 351) (= main_~i~0 27))} is VALID [2022-04-08 09:53:54,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {18094#(and (= main_~sum~0 351) (= main_~i~0 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18098#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} is VALID [2022-04-08 09:53:54,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {18098#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18102#(and (= 378 main_~sum~0) (= main_~i~0 28))} is VALID [2022-04-08 09:53:54,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {18102#(and (= 378 main_~sum~0) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18106#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} is VALID [2022-04-08 09:53:54,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {18106#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18110#(and (= (+ (- 1) main_~i~0) 28) (= main_~sum~0 (+ main_~i~0 377)))} is VALID [2022-04-08 09:53:54,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {18110#(and (= (+ (- 1) main_~i~0) 28) (= main_~sum~0 (+ main_~i~0 377)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18114#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 377)) (= (+ (- 1) main_~i~0) 28))} is VALID [2022-04-08 09:53:54,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {18114#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 377)) (= (+ (- 1) main_~i~0) 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18118#(and (= (+ (- 2) main_~i~0) 28) (= (+ main_~i~0 376) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:53:54,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {18118#(and (= (+ (- 2) main_~i~0) 28) (= (+ main_~i~0 376) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18122#(and (= main_~sum~0 (+ 375 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 28))} is VALID [2022-04-08 09:53:54,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {18122#(and (= main_~sum~0 (+ 375 (* main_~i~0 3))) (= (+ (- 2) main_~i~0) 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18126#(and (= main_~sum~0 465) (= main_~i~0 31))} is VALID [2022-04-08 09:53:54,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {18126#(and (= main_~sum~0 465) (= main_~i~0 31))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18130#(and (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 465) (= main_~i~0 31))} is VALID [2022-04-08 09:53:54,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {18130#(and (<= main_~i~0 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 465) (= main_~i~0 31))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18134#(and (<= main_~i~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} is VALID [2022-04-08 09:53:54,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {18134#(and (<= main_~i~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} assume !(~i~0 <= ~n~0); {18138#(and (< main_~n~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} is VALID [2022-04-08 09:53:54,169 INFO L272 TraceCheckUtils]: 70: Hoare triple {18138#(and (< main_~n~0 32) (= 465 (+ (- 31) main_~sum~0)) (<= 31 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:53:54,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:53:54,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {18146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17864#false} is VALID [2022-04-08 09:53:54,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {17864#false} assume !false; {17864#false} is VALID [2022-04-08 09:53:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:53:54,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:55:08,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {17864#false} assume !false; {17864#false} is VALID [2022-04-08 09:55:08,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {18146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17864#false} is VALID [2022-04-08 09:55:08,334 INFO L290 TraceCheckUtils]: 71: Hoare triple {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:55:08,334 INFO L272 TraceCheckUtils]: 70: Hoare triple {18162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {18142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:55:08,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {18166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {18162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:55:08,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {18170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:55:08,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:55:08,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,511 INFO L290 TraceCheckUtils]: 52: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:08,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:08,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:09,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:09,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:09,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:09,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:09,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:55:09,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {18174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:55:09,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {17863#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17863#true} is VALID [2022-04-08 09:55:09,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {17863#true} call #t~ret3 := main(); {17863#true} is VALID [2022-04-08 09:55:09,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17863#true} {17863#true} #55#return; {17863#true} is VALID [2022-04-08 09:55:09,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {17863#true} assume true; {17863#true} is VALID [2022-04-08 09:55:09,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {17863#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(9, 2); {17863#true} is VALID [2022-04-08 09:55:09,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {17863#true} call ULTIMATE.init(); {17863#true} is VALID [2022-04-08 09:55:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-04-08 09:55:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:55:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656405785] [2022-04-08 09:55:09,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:55:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226579839] [2022-04-08 09:55:09,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226579839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:55:09,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:55:09,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 9] total 73 [2022-04-08 09:55:09,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:55:09,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201758684] [2022-04-08 09:55:09,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201758684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:55:09,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:55:09,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-08 09:55:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349560478] [2022-04-08 09:55:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:55:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 09:55:09,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:55:09,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:55:09,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:55:09,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-08 09:55:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:55:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-08 09:55:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=5041, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 09:55:09,452 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:56:12,508 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-08 09:56:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-08 09:56:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-08 09:56:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:56:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-08 09:56:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-08 09:56:12,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 82 transitions. [2022-04-08 09:56:13,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:56:13,118 INFO L225 Difference]: With dead ends: 82 [2022-04-08 09:56:13,118 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 09:56:13,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 31 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 77.7s TimeCoverageRelationStatistics Valid=226, Invalid=5324, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 09:56:13,118 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 4486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 4487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:56:13,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 4487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4486 Invalid, 0 Unknown, 0 Unchecked, 31.8s Time] [2022-04-08 09:56:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 09:56:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-08 09:56:13,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:56:13,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:13,170 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:13,170 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:56:13,171 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-08 09:56:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-08 09:56:13,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:56:13,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:56:13,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 09:56:13,171 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 09:56:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:56:13,172 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-08 09:56:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-08 09:56:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:56:13,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:56:13,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:56:13,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:56:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-08 09:56:13,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2022-04-08 09:56:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:56:13,173 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-08 09:56:13,173 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:56:13,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-08 09:56:13,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:56:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-08 09:56:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 09:56:13,853 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:56:13,853 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:56:13,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 09:56:14,053 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-08 09:56:14,053 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:56:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:56:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 829928917, now seen corresponding path program 63 times [2022-04-08 09:56:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:56:14,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390556219] [2022-04-08 09:56:14,056 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:56:14,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:56:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 829928917, now seen corresponding path program 64 times [2022-04-08 09:56:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:56:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183860852] [2022-04-08 09:56:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:56:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:56:14,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:56:14,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676766732] [2022-04-08 09:56:14,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:56:14,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:56:14,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:56:14,073 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-08 09:56:14,074 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-08 09:56:14,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:56:14,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:56:14,138 WARN L261 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 09:56:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:56:14,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:56:17,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {18855#true} call ULTIMATE.init(); {18855#true} is VALID [2022-04-08 09:56:17,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {18855#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(9, 2); {18855#true} is VALID [2022-04-08 09:56:17,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {18855#true} assume true; {18855#true} is VALID [2022-04-08 09:56:17,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18855#true} {18855#true} #55#return; {18855#true} is VALID [2022-04-08 09:56:17,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {18855#true} call #t~ret3 := main(); {18855#true} is VALID [2022-04-08 09:56:17,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {18855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18855#true} is VALID [2022-04-08 09:56:17,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {18878#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:56:17,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {18878#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:56:17,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {18882#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} is VALID [2022-04-08 09:56:17,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {18886#(and (= main_~sum~0 1) (= (+ main_~sum~0 1) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18890#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-08 09:56:17,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {18890#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18894#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2022-04-08 09:56:17,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {18894#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18898#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} is VALID [2022-04-08 09:56:17,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {18898#(and (= main_~i~0 3) (= (+ main_~i~0 3) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18902#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2022-04-08 09:56:17,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {18902#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2022-04-08 09:56:17,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {18906#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18910#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} is VALID [2022-04-08 09:56:17,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {18910#(and (= (+ 5 main_~i~0) main_~sum~0) (= (+ (- 1) main_~i~0) 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18914#(and (= (+ (- 1) main_~i~0) 4) (= (+ 5 main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:56:17,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {18914#(and (= (+ (- 1) main_~i~0) 4) (= (+ 5 main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18918#(and (= (+ (- 2) main_~i~0) 4) (= (+ main_~i~0 4) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:56:17,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {18918#(and (= (+ (- 2) main_~i~0) 4) (= (+ main_~i~0 4) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18922#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} is VALID [2022-04-08 09:56:17,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {18922#(and (= (+ 3 (* main_~i~0 3)) main_~sum~0) (= (+ (- 2) main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18926#(and (= 7 main_~i~0) (= main_~sum~0 21))} is VALID [2022-04-08 09:56:17,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {18926#(and (= 7 main_~i~0) (= main_~sum~0 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18930#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} is VALID [2022-04-08 09:56:17,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {18930#(and (= 7 main_~i~0) (= (+ main_~i~0 21) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18934#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} is VALID [2022-04-08 09:56:17,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {18934#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ main_~i~0 20)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18938#(and (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} is VALID [2022-04-08 09:56:17,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {18938#(and (= 7 (+ (- 1) main_~i~0)) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ main_~i~0 20)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18942#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 19 main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:56:17,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {18942#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 19 main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18946#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 19 main_~i~0)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:56:17,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {18946#(and (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ 19 main_~i~0)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18950#(and (= (+ main_~i~0 18) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:56:17,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {18950#(and (= (+ main_~i~0 18) (+ main_~sum~0 3 (* (- 2) main_~i~0))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18954#(and (= (+ main_~i~0 18) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:56:17,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {18954#(and (= (+ main_~i~0 18) (+ main_~sum~0 3 (* main_~i~0 (- 3)))) (= (+ main_~i~0 (- 3)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18958#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) (+ main_~i~0 17)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:56:17,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {18958#(and (= (+ main_~sum~0 6 (* main_~i~0 (- 3))) (+ main_~i~0 17)) (= 7 (+ main_~i~0 (- 4))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18962#(and (= main_~sum~0 (+ (* 5 main_~i~0) 11)) (= 7 (+ main_~i~0 (- 4))))} is VALID [2022-04-08 09:56:17,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#(and (= main_~sum~0 (+ (* 5 main_~i~0) 11)) (= 7 (+ main_~i~0 (- 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18966#(and (= main_~i~0 12) (= 66 main_~sum~0))} is VALID [2022-04-08 09:56:17,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {18966#(and (= main_~i~0 12) (= 66 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18970#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} is VALID [2022-04-08 09:56:17,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {18970#(and (= main_~i~0 12) (= main_~sum~0 (+ 66 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18974#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:56:17,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {18974#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18978#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:56:17,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#(and (= (+ (- 1) main_~i~0) 12) (= (+ 65 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18982#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} is VALID [2022-04-08 09:56:17,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {18982#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 2) 63)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18986#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} is VALID [2022-04-08 09:56:17,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {18986#(and (= 12 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ (* main_~i~0 3) 63)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= main_~i~0 15) (= main_~sum~0 105))} is VALID [2022-04-08 09:56:17,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {18990#(and (= main_~i~0 15) (= main_~sum~0 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {18994#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} is VALID [2022-04-08 09:56:17,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {18994#(and (= main_~i~0 15) (= (+ (* (- 1) main_~i~0) main_~sum~0) 105))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18998#(and (= (+ (- 1) main_~i~0) 15) (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 105))} is VALID [2022-04-08 09:56:17,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {18998#(and (= (+ (- 1) main_~i~0) 15) (= (+ (* (- 1) main_~i~0) main_~sum~0 1) 105))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19002#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} is VALID [2022-04-08 09:56:17,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {19002#(and (= main_~sum~0 (+ 104 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19006#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2022-04-08 09:56:17,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {19006#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19010#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} is VALID [2022-04-08 09:56:17,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {19010#(and (= main_~i~0 17) (= main_~sum~0 (+ main_~i~0 136)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19014#(and (= 153 main_~sum~0) (= main_~i~0 18))} is VALID [2022-04-08 09:56:17,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {19014#(and (= 153 main_~sum~0) (= main_~i~0 18))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19018#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} is VALID [2022-04-08 09:56:17,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {19018#(and (= main_~i~0 18) (= (+ (* (- 1) main_~i~0) main_~sum~0) 153))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19022#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:56:17,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {19022#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19026#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} is VALID [2022-04-08 09:56:17,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {19026#(and (= (+ (- 1) main_~i~0) 18) (= 153 (+ main_~sum~0 (* (- 2) main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19030#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} is VALID [2022-04-08 09:56:17,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {19030#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19034#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} is VALID [2022-04-08 09:56:17,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {19034#(and (= main_~i~0 20) (= main_~sum~0 (+ 190 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19038#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2022-04-08 09:56:17,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {19038#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19042#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-08 09:56:17,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {19042#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19046#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:56:17,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {19046#(and (= (+ main_~i~0 209) main_~sum~0) (= (+ (- 1) main_~i~0) 21))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19050#(and (= (+ main_~i~0 209) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ (- 1) main_~i~0) 21))} is VALID [2022-04-08 09:56:17,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {19050#(and (= (+ main_~i~0 209) (+ (* (- 1) main_~i~0) main_~sum~0)) (= (+ (- 1) main_~i~0) 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19054#(and (= (+ main_~sum~0 (- 22)) 231) (= 23 main_~i~0))} is VALID [2022-04-08 09:56:17,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {19054#(and (= (+ main_~sum~0 (- 22)) 231) (= 23 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19058#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} is VALID [2022-04-08 09:56:17,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {19058#(and (= main_~sum~0 (+ main_~i~0 253)) (= 23 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19062#(and (= 276 main_~sum~0) (= main_~i~0 24))} is VALID [2022-04-08 09:56:17,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {19062#(and (= 276 main_~sum~0) (= main_~i~0 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19066#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 276) (= main_~i~0 24))} is VALID [2022-04-08 09:56:17,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {19066#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 276) (= main_~i~0 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19070#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} is VALID [2022-04-08 09:56:17,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {19070#(and (= main_~i~0 (+ (- 275) main_~sum~0)) (= (+ main_~sum~0 (- 276)) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19074#(and (= main_~sum~0 (+ 275 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 24))} is VALID [2022-04-08 09:56:17,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {19074#(and (= main_~sum~0 (+ 275 (* main_~i~0 2))) (= (+ (- 1) main_~i~0) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19078#(and (= (+ 273 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 24))} is VALID [2022-04-08 09:56:17,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {19078#(and (= (+ 273 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 24))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 273 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 24))} is VALID [2022-04-08 09:56:17,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {19082#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 273 (* main_~i~0 2))) (= (+ (- 2) main_~i~0) 24))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19086#(and (= (+ main_~i~0 (- 3)) 24) (= (+ (* main_~i~0 2) 271) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:56:17,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {19086#(and (= (+ main_~i~0 (- 3)) 24) (= (+ (* main_~i~0 2) 271) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19090#(and (= (+ main_~i~0 (- 3)) 24) (= main_~sum~0 (+ 270 (* main_~i~0 4))))} is VALID [2022-04-08 09:56:17,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {19090#(and (= (+ main_~i~0 (- 3)) 24) (= main_~sum~0 (+ 270 (* main_~i~0 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19094#(and (= 378 main_~sum~0) (= main_~i~0 28))} is VALID [2022-04-08 09:56:17,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {19094#(and (= 378 main_~sum~0) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19098#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} is VALID [2022-04-08 09:56:17,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {19098#(and (= main_~sum~0 (+ 378 main_~i~0)) (= main_~i~0 28))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19102#(and (= (+ (- 378) main_~sum~0) 28) (= (+ (- 377) main_~sum~0) main_~i~0))} is VALID [2022-04-08 09:56:17,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {19102#(and (= (+ (- 378) main_~sum~0) 28) (= (+ (- 377) main_~sum~0) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19106#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} is VALID [2022-04-08 09:56:17,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {19106#(and (= 29 main_~i~0) (= main_~sum~0 (+ main_~i~0 406)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19110#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} is VALID [2022-04-08 09:56:17,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {19110#(and (= (+ (- 1) main_~i~0) 29) (= main_~sum~0 (+ 405 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19114#(and (= (+ (- 1) main_~i~0) 29) (= (+ 405 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:56:17,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {19114#(and (= (+ (- 1) main_~i~0) 29) (= (+ 405 (* main_~i~0 2)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19118#(and (= 29 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 403 (* main_~i~0 2))))} is VALID [2022-04-08 09:56:17,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {19118#(and (= 29 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 403 (* main_~i~0 2))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19122#(and (= 29 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 403 (* main_~i~0 3))))} is VALID [2022-04-08 09:56:17,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {19122#(and (= 29 (+ (- 2) main_~i~0)) (= main_~sum~0 (+ 403 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19126#(and (= 32 main_~i~0) (= 496 main_~sum~0))} is VALID [2022-04-08 09:56:17,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {19126#(and (= 32 main_~i~0) (= 496 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19130#(and (<= main_~i~0 main_~n~0) (= 32 main_~i~0) (= main_~sum~0 (+ 496 main_~i~0)))} is VALID [2022-04-08 09:56:17,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {19130#(and (<= main_~i~0 main_~n~0) (= 32 main_~i~0) (= main_~sum~0 (+ 496 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19134#(and (<= 32 main_~n~0) (= main_~sum~0 528) (<= main_~i~0 33))} is VALID [2022-04-08 09:56:17,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {19134#(and (<= 32 main_~n~0) (= main_~sum~0 528) (<= main_~i~0 33))} assume !(~i~0 <= ~n~0); {19138#(and (<= 32 main_~n~0) (= main_~sum~0 528) (< main_~n~0 33))} is VALID [2022-04-08 09:56:17,815 INFO L272 TraceCheckUtils]: 72: Hoare triple {19138#(and (<= 32 main_~n~0) (= main_~sum~0 528) (< main_~n~0 33))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {19142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:56:17,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {19142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:56:17,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {19146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18856#false} is VALID [2022-04-08 09:56:17,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {18856#false} assume !false; {18856#false} is VALID [2022-04-08 09:56:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:56:17,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:57:37,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {18856#false} assume !false; {18856#false} is VALID [2022-04-08 09:57:37,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {19146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18856#false} is VALID [2022-04-08 09:57:37,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {19142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:57:37,926 INFO L272 TraceCheckUtils]: 72: Hoare triple {19162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {19142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:57:37,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {19166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} assume !(~i~0 <= ~n~0); {19162#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-08 09:57:37,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {19170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19166#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:57:37,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19170#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-08 09:57:37,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:37,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19178#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-08 09:57:38,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {18855#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {19174#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-08 09:57:38,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {18855#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18855#true} is VALID [2022-04-08 09:57:38,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {18855#true} call #t~ret3 := main(); {18855#true} is VALID [2022-04-08 09:57:38,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18855#true} {18855#true} #55#return; {18855#true} is VALID [2022-04-08 09:57:38,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {18855#true} assume true; {18855#true} is VALID [2022-04-08 09:57:38,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {18855#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(9, 2); {18855#true} is VALID [2022-04-08 09:57:38,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {18855#true} call ULTIMATE.init(); {18855#true} is VALID [2022-04-08 09:57:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2022-04-08 09:57:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:57:38,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183860852] [2022-04-08 09:57:38,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:57:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676766732] [2022-04-08 09:57:38,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676766732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:57:38,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:57:38,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 9] total 75 [2022-04-08 09:57:38,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:57:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390556219] [2022-04-08 09:57:38,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390556219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:57:38,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:57:38,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-08 09:57:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618275676] [2022-04-08 09:57:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:57:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-08 09:57:38,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:57:38,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:57:39,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:57:39,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-08 09:57:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:57:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-08 09:57:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=5329, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 09:57:39,440 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:58:31,797 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-08 09:58:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-08 09:58:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-08 09:58:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:58:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-08 09:58:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-08 09:58:31,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-08 09:58:32,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:58:32,308 INFO L225 Difference]: With dead ends: 84 [2022-04-08 09:58:32,309 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 09:58:32,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 46 SyntacticMatches, 32 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=232, Invalid=5620, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 09:58:32,309 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 4691 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:58:32,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 482 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4691 Invalid, 0 Unknown, 0 Unchecked, 30.4s Time] [2022-04-08 09:58:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 09:58:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 09:58:32,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:58:32,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:32,363 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:32,363 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:58:32,380 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-08 09:58:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-08 09:58:32,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:58:32,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:58:32,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 09:58:32,380 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 09:58:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:58:32,381 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-08 09:58:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-08 09:58:32,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:58:32,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:58:32,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:58:32,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:58:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-08 09:58:32,382 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2022-04-08 09:58:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:58:32,382 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-08 09:58:32,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:58:32,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-08 09:58:32,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:58:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-08 09:58:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 09:58:32,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:58:32,920 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:58:32,936 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-08 09:58:33,120 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-08 09:58:33,120 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:58:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:58:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash -200232333, now seen corresponding path program 65 times [2022-04-08 09:58:33,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:58:33,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14212392] [2022-04-08 09:58:33,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:58:33,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:58:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -200232333, now seen corresponding path program 66 times [2022-04-08 09:58:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:58:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282629381] [2022-04-08 09:58:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:58:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:58:33,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:58:33,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935403156] [2022-04-08 09:58:33,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:58:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:58:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:58:33,144 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-08 09:58:33,163 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-08 09:58:33,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-08 09:58:33,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:58:33,230 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-08 09:58:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:58:33,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:58:42,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {19873#true} call ULTIMATE.init(); {19873#true} is VALID [2022-04-08 09:58:42,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {19873#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(9, 2); {19873#true} is VALID [2022-04-08 09:58:42,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {19873#true} assume true; {19873#true} is VALID [2022-04-08 09:58:42,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19873#true} {19873#true} #55#return; {19873#true} is VALID [2022-04-08 09:58:42,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {19873#true} call #t~ret3 := main(); {19873#true} is VALID [2022-04-08 09:58:42,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {19873#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19873#true} is VALID [2022-04-08 09:58:42,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {19896#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-08 09:58:42,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {19896#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19900#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-08 09:58:42,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {19900#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19904#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-08 09:58:42,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {19904#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19908#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} is VALID [2022-04-08 09:58:42,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {19908#(and (= main_~sum~0 (+ main_~i~0 1)) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19912#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} is VALID [2022-04-08 09:58:42,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {19912#(and (= main_~sum~0 main_~i~0) (= (+ (- 1) main_~sum~0) 2))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19916#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} is VALID [2022-04-08 09:58:42,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {19916#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) main_~i~0) (= 2 (+ (- 1) (* (- 1) main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19920#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 2) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:58:42,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {19920#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 2) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19924#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 3))) (= 2 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:58:42,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {19924#(and (= main_~sum~0 (+ (- 2) (* main_~i~0 3))) (= 2 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19928#(and (= 5 main_~i~0) (= main_~sum~0 10))} is VALID [2022-04-08 09:58:42,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {19928#(and (= 5 main_~i~0) (= main_~sum~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19932#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} is VALID [2022-04-08 09:58:42,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {19932#(and (= 5 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19936#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} is VALID [2022-04-08 09:58:42,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {19936#(and (= main_~i~0 6) (= (+ main_~sum~0 (- 5)) 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19940#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} is VALID [2022-04-08 09:58:42,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {19940#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 5)) 10) (= main_~i~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19944#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} is VALID [2022-04-08 09:58:42,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {19944#(and (= 6 (+ (- 15) main_~sum~0)) (= main_~i~0 (+ (- 14) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19948#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} is VALID [2022-04-08 09:58:42,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {19948#(and (= main_~i~0 (+ (- 14) (* (- 1) main_~i~0) main_~sum~0)) (= (+ (* (- 1) main_~i~0) (- 15) main_~sum~0) 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19952#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} is VALID [2022-04-08 09:58:42,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {19952#(and (= (+ (- 14) (* (- 1) main_~i~0) main_~sum~0) 6) (= (+ (- 1) main_~i~0) (+ (* (- 1) main_~i~0) (- 13) main_~sum~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19956#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} is VALID [2022-04-08 09:58:42,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {19956#(and (= 7 (+ (- 1) main_~i~0)) (= main_~sum~0 (+ 20 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19960#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:58:42,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {19960#(and (= 7 (+ (- 2) main_~i~0)) (= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19964#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:58:42,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {19964#(and (= main_~sum~0 (+ (* main_~i~0 3) 18)) (= 7 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19968#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:58:42,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {19968#(and (= main_~sum~0 (+ 15 (* main_~i~0 3))) (= (+ main_~i~0 (- 3)) 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19972#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} is VALID [2022-04-08 09:58:42,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {19972#(and (= main_~sum~0 (+ 15 (* main_~i~0 4))) (= (+ main_~i~0 (- 3)) 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19976#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2022-04-08 09:58:42,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {19976#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19980#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} is VALID [2022-04-08 09:58:42,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {19980#(and (= main_~i~0 11) (= main_~sum~0 (+ main_~i~0 55)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19984#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} is VALID [2022-04-08 09:58:42,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {19984#(and (= 11 (+ (- 55) main_~sum~0)) (= (+ main_~sum~0 (- 54)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} is VALID [2022-04-08 09:58:42,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {19988#(and (= (+ (* (- 1) main_~i~0) main_~sum~0 (- 54)) main_~i~0) (= (+ (- 55) (* (- 1) main_~i~0) main_~sum~0) 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {19992#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} is VALID [2022-04-08 09:58:42,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {19992#(and (= (+ main_~sum~0 (- 66)) 12) (= (+ main_~sum~0 (- 65)) main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {19996#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2022-04-08 09:58:42,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {19996#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20000#(and (= 91 main_~sum~0) (= main_~i~0 14))} is VALID [2022-04-08 09:58:42,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {20000#(and (= 91 main_~sum~0) (= main_~i~0 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20004#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} is VALID [2022-04-08 09:58:42,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {20004#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0)) (= main_~i~0 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20008#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:58:42,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {20008#(and (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= (+ (- 1) main_~i~0) 14))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20012#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} is VALID [2022-04-08 09:58:42,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {20012#(and (= 91 (+ main_~sum~0 (* (- 2) main_~i~0) 1)) (= (+ (- 1) main_~i~0) 14))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20016#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} is VALID [2022-04-08 09:58:42,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {20016#(and (= main_~i~0 16) (= 91 (+ main_~sum~0 (- 29))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20020#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} is VALID [2022-04-08 09:58:42,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {20020#(and (= main_~i~0 16) (= 91 (+ (* (- 1) main_~i~0) main_~sum~0 (- 29))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20024#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} is VALID [2022-04-08 09:58:42,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {20024#(and (= 91 (+ (* (- 1) main_~i~0) (- 28) main_~sum~0)) (= (+ (- 1) main_~i~0) 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20028#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} is VALID [2022-04-08 09:58:42,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {20028#(and (= (+ (- 1) main_~i~0) 16) (= main_~sum~0 (+ 119 (* main_~i~0 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20032#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-08 09:58:42,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {20032#(and (= 16 (+ (- 2) main_~i~0)) (= (+ 117 (* main_~i~0 2)) main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20036#(and (= (+ 117 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= 16 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:58:42,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {20036#(and (= (+ 117 (* main_~i~0 2)) (+ (* (- 1) main_~i~0) main_~sum~0)) (= 16 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20040#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} is VALID [2022-04-08 09:58:42,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {20040#(and (= 153 (+ main_~sum~0 (- 18))) (= 19 main_~i~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20044#(and (= 19 main_~i~0) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 18))))} is VALID [2022-04-08 09:58:42,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {20044#(and (= 19 main_~i~0) (= 153 (+ (* (- 1) main_~i~0) main_~sum~0 (- 18))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20048#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} is VALID [2022-04-08 09:58:42,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {20048#(and (= main_~i~0 20) (= (+ (- 37) main_~sum~0) 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20052#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} is VALID [2022-04-08 09:58:42,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {20052#(and (= main_~i~0 20) (= 153 (+ (* (- 1) main_~i~0) (- 37) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20056#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} is VALID [2022-04-08 09:58:42,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {20056#(and (= main_~i~0 21) (= 153 (+ main_~sum~0 (- 57))))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20060#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} is VALID [2022-04-08 09:58:42,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {20060#(and (= main_~i~0 21) (= (+ main_~i~0 210) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20064#(and (= main_~i~0 22) (= main_~sum~0 231))} is VALID [2022-04-08 09:58:42,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {20064#(and (= main_~i~0 22) (= main_~sum~0 231))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20068#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} is VALID [2022-04-08 09:58:42,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {20068#(and (= main_~i~0 22) (= main_~sum~0 (+ main_~i~0 231)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20072#(and (= 23 main_~i~0) (= main_~sum~0 253))} is VALID [2022-04-08 09:58:42,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {20072#(and (= 23 main_~i~0) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20076#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} is VALID [2022-04-08 09:58:42,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {20076#(and (= 23 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 253))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20080#(and (= 253 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:58:42,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {20080#(and (= 253 (+ (* (- 1) main_~i~0) main_~sum~0 1)) (= 23 (+ (- 1) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20084#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} is VALID [2022-04-08 09:58:42,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {20084#(and (= (+ 252 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 1) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20088#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:58:42,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {20088#(and (= (+ 250 (* main_~i~0 2)) main_~sum~0) (= 23 (+ (- 2) main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20092#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} is VALID [2022-04-08 09:58:42,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {20092#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 250 (* main_~i~0 2))) (= 23 (+ (- 2) main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20096#(and (= (+ main_~i~0 (- 3)) 23) (= (+ (* main_~i~0 2) 248) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} is VALID [2022-04-08 09:58:42,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {20096#(and (= (+ main_~i~0 (- 3)) 23) (= (+ (* main_~i~0 2) 248) (+ (* (- 1) main_~i~0) main_~sum~0 1)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20100#(and (= (+ main_~i~0 (- 3)) 23) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 248)))} is VALID [2022-04-08 09:58:42,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {20100#(and (= (+ main_~i~0 (- 3)) 23) (= (+ main_~sum~0 (* (- 2) main_~i~0) 1) (+ (* main_~i~0 2) 248)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20104#(and (= main_~i~0 27) (= (+ (- 51) main_~sum~0) 300))} is VALID [2022-04-08 09:58:42,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {20104#(and (= main_~i~0 27) (= (+ (- 51) main_~sum~0) 300))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20108#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} is VALID [2022-04-08 09:58:42,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {20108#(and (= main_~i~0 27) (= main_~sum~0 (+ main_~i~0 351)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20112#(and (= main_~sum~0 (+ main_~i~0 350)) (= (+ (- 1) main_~i~0) 27))} is VALID [2022-04-08 09:58:42,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {20112#(and (= main_~sum~0 (+ main_~i~0 350)) (= (+ (- 1) main_~i~0) 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20116#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} is VALID [2022-04-08 09:58:42,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {20116#(and (= main_~sum~0 (+ (* main_~i~0 2) 350)) (= (+ (- 1) main_~i~0) 27))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20120#(and (= (+ 348 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 27))} is VALID [2022-04-08 09:58:42,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {20120#(and (= (+ 348 (* main_~i~0 2)) main_~sum~0) (= (+ (- 2) main_~i~0) 27))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20124#(and (= (+ (- 2) main_~i~0) 27) (= main_~sum~0 (+ 348 (* main_~i~0 3))))} is VALID [2022-04-08 09:58:42,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {20124#(and (= (+ (- 2) main_~i~0) 27) (= main_~sum~0 (+ 348 (* main_~i~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20128#(and (= 30 main_~i~0) (= 435 main_~sum~0))} is VALID [2022-04-08 09:58:42,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {20128#(and (= 30 main_~i~0) (= 435 main_~sum~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20132#(and (= 30 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 435))} is VALID [2022-04-08 09:58:42,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {20132#(and (= 30 main_~i~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 435))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20136#(and (= 435 (+ main_~sum~0 (- 30))) (= main_~i~0 31))} is VALID [2022-04-08 09:58:42,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {20136#(and (= 435 (+ main_~sum~0 (- 30))) (= main_~i~0 31))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20140#(and (= main_~sum~0 (+ main_~i~0 465)) (= main_~i~0 31))} is VALID [2022-04-08 09:58:42,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {20140#(and (= main_~sum~0 (+ main_~i~0 465)) (= main_~i~0 31))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20144#(and (= (+ (- 1) main_~i~0) 31) (= main_~sum~0 (+ 464 main_~i~0)))} is VALID [2022-04-08 09:58:42,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {20144#(and (= (+ (- 1) main_~i~0) 31) (= main_~sum~0 (+ 464 main_~i~0)))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20148#(and (= (+ (- 1) main_~i~0) 31) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 464 main_~i~0)))} is VALID [2022-04-08 09:58:42,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {20148#(and (= (+ (- 1) main_~i~0) 31) (= (+ (* (- 1) main_~i~0) main_~sum~0) (+ 464 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20152#(and (= (+ main_~sum~0 (- 32)) 496) (= main_~i~0 33))} is VALID [2022-04-08 09:58:42,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {20152#(and (= (+ main_~sum~0 (- 32)) 496) (= main_~i~0 33))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {20156#(and (<= main_~i~0 main_~n~0) (= main_~i~0 33) (= 496 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} is VALID [2022-04-08 09:58:42,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {20156#(and (<= main_~i~0 main_~n~0) (= main_~i~0 33) (= 496 (+ (* (- 1) main_~i~0) main_~sum~0 (- 32))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20160#(and (= 496 (+ main_~sum~0 (- 65))) (<= main_~i~0 34) (<= 33 main_~n~0))} is VALID [2022-04-08 09:58:42,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {20160#(and (= 496 (+ main_~sum~0 (- 65))) (<= main_~i~0 34) (<= 33 main_~n~0))} assume !(~i~0 <= ~n~0); {20164#(and (= 496 (+ main_~sum~0 (- 65))) (< main_~n~0 34) (<= 33 main_~n~0))} is VALID [2022-04-08 09:58:42,190 INFO L272 TraceCheckUtils]: 74: Hoare triple {20164#(and (= 496 (+ main_~sum~0 (- 65))) (< main_~n~0 34) (<= 33 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {20168#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:58:42,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {20168#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20172#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:58:42,191 INFO L290 TraceCheckUtils]: 76: Hoare triple {20172#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19874#false} is VALID [2022-04-08 09:58:42,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {19874#false} assume !false; {19874#false} is VALID [2022-04-08 09:58:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:58:42,192 INFO L328 TraceCheckSpWp]: Computing backward predicates...