/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:41:16,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:41:16,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:41:16,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:41:16,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:41:16,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:41:16,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:41:16,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:41:16,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:41:16,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:41:16,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:41:16,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:41:16,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:41:16,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:41:16,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:41:16,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:41:16,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:41:16,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:41:16,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:41:16,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:41:16,304 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:41:16,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:41:16,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:41:16,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:41:16,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:41:16,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:41:16,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:41:16,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:41:16,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:41:16,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:41:16,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:41:16,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:41:16,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:41:16,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:41:16,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:41:16,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:41:16,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:41:16,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:41:16,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:41:16,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:41:16,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:41:16,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:41:16,319 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:41:16,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:41:16,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:41:16,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:41:16,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:41:16,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:41:16,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:41:16,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:41:16,330 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:41:16,330 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:41:16,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:41:16,330 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:41:16,330 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:41:16,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:41:16,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:41:16,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:41:16,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:41:16,507 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:41:16,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-08 09:41:16,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc304561/7930880a955e4ca59a06cfc596b3ef3f/FLAGc6502693f [2022-04-08 09:41:16,869 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:41:16,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-08 09:41:16,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc304561/7930880a955e4ca59a06cfc596b3ef3f/FLAGc6502693f [2022-04-08 09:41:17,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc304561/7930880a955e4ca59a06cfc596b3ef3f [2022-04-08 09:41:17,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:41:17,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:41:17,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:41:17,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:41:17,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:41:17,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc5eca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17, skipping insertion in model container [2022-04-08 09:41:17,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:41:17,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:41:17,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-08 09:41:17,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:41:17,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:41:17,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-08 09:41:17,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:41:17,532 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:41:17,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17 WrapperNode [2022-04-08 09:41:17,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:41:17,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:41:17,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:41:17,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:41:17,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:41:17,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:41:17,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:41:17,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:41:17,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (1/1) ... [2022-04-08 09:41:17,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:41:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:17,608 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:41:17,624 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:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:41:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:41:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:41:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:41:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:41:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:41:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:41:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:41:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:41:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:41:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:41:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:41:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:41:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:41:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:41:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:41:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:41:17,687 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:41:17,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:41:17,806 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:41:17,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:41:17,811 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 09:41:17,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:41:17 BoogieIcfgContainer [2022-04-08 09:41:17,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:41:17,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:41:17,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:41:17,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:41:17,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:41:17" (1/3) ... [2022-04-08 09:41:17,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb66534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:41:17, skipping insertion in model container [2022-04-08 09:41:17,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:41:17" (2/3) ... [2022-04-08 09:41:17,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb66534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:41:17, skipping insertion in model container [2022-04-08 09:41:17,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:41:17" (3/3) ... [2022-04-08 09:41:17,825 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.c [2022-04-08 09:41:17,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:41:17,828 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:41:17,854 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:41:17,859 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:41:17,860 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:41:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:41:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:41:17,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:17,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:17,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 1 times [2022-04-08 09:41:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:17,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566726994] [2022-04-08 09:41:17,894 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 2 times [2022-04-08 09:41:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988754258] [2022-04-08 09:41:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:17,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693469275] [2022-04-08 09:41:17,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:17,993 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:41:17,994 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:41:18,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:41:18,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:18,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:41:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:18,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:18,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-08 09:41:18,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2022-04-08 09:41:18,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:41:18,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-08 09:41:18,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 09:41:18,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-08 09:41:18,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2022-04-08 09:41:18,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:18,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:18,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:41:18,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:18,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:18,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-08 09:41:18,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:18,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2022-04-08 09:41:18,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 09:41:18,557 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:41:18,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:41:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988754258] [2022-04-08 09:41:18,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693469275] [2022-04-08 09:41:18,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693469275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:18,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:18,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:41:18,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566726994] [2022-04-08 09:41:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566726994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:18,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:18,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:41:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836130408] [2022-04-08 09:41:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:41:18,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:18,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,584 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:41:18,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:41:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:41:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:41:18,600 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:18,894 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 09:41:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:41:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:41:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 09:41:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 09:41:18,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 09:41:18,941 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:41:18,946 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:41:18,946 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:41:18,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:41:18,950 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:18,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:41:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:41:18,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:18,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,971 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,971 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:18,973 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:41:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:41:18,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:18,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:18,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:41:18,974 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:41:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:18,975 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:41:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:41:18,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:18,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:18,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:18,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:41:18,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 09:41:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:18,978 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:41:18,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:18,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:41:18,991 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:41:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:41:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:41:18,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:18,992 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:19,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:41:19,199 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:41:19,200 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 1 times [2022-04-08 09:41:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:19,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1316611838] [2022-04-08 09:41:19,203 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 2 times [2022-04-08 09:41:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:19,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936595747] [2022-04-08 09:41:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:19,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:19,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711569432] [2022-04-08 09:41:19,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:19,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:19,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:19,221 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:41:19,254 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:41:19,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:41:19,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:19,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 09:41:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:19,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:19,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-08 09:41:19,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {236#true} is VALID [2022-04-08 09:41:19,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-08 09:41:19,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-08 09:41:19,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-08 09:41:19,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {236#true} is VALID [2022-04-08 09:41:19,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {259#(<= 1 main_~main__n~0)} is VALID [2022-04-08 09:41:19,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {263#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:19,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:41:19,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:41:19,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:41:19,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:41:19,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:41:19,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 09:41:19,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:19,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-08 09:41:19,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-08 09:41:19,557 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:41:19,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:19,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-08 09:41:19,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-08 09:41:19,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:19,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {304#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:19,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 09:41:19,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {312#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:41:19,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {316#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:41:19,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {320#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:41:19,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {324#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:41:19,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {328#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:41:19,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {236#true} is VALID [2022-04-08 09:41:19,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {236#true} is VALID [2022-04-08 09:41:19,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-08 09:41:19,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-08 09:41:19,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-08 09:41:19,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {236#true} is VALID [2022-04-08 09:41:19,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-08 09:41:19,878 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:41:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:19,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936595747] [2022-04-08 09:41:19,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:19,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711569432] [2022-04-08 09:41:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711569432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:19,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:19,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-04-08 09:41:19,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:19,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1316611838] [2022-04-08 09:41:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1316611838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:19,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:19,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:41:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79259858] [2022-04-08 09:41:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:41:19,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:19,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:19,895 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:41:19,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:41:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:41:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:41:19,898 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:20,079 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:41:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:41:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:41:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 09:41:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 09:41:20,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 22 transitions. [2022-04-08 09:41:20,102 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:41:20,103 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:41:20,104 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 09:41:20,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:41:20,105 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:20,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 09:41:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 09:41:20,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:20,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,117 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,117 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:20,118 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:41:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:41:20,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:20,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:20,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:41:20,119 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:41:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:20,120 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:41:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:41:20,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:20,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:20,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:20,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 09:41:20,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-08 09:41:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:20,121 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 09:41:20,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:20,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 09:41:20,136 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:41:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:41:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:41:20,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:20,137 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:20,156 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:41:20,353 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:41:20,353 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 3 times [2022-04-08 09:41:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:20,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112010902] [2022-04-08 09:41:20,355 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 4 times [2022-04-08 09:41:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:20,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983055979] [2022-04-08 09:41:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:20,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:20,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480834114] [2022-04-08 09:41:20,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:41:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:20,380 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:41:20,381 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:41:20,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:41:20,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:20,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 09:41:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:20,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:20,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-08 09:41:20,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {477#true} is VALID [2022-04-08 09:41:20,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-08 09:41:20,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-08 09:41:20,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-08 09:41:20,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-08 09:41:20,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-08 09:41:20,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {503#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:20,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {507#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:41:20,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {511#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:41:20,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {515#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:20,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {519#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 09:41:20,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {523#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:20,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {523#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {527#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:20,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {527#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {531#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:41:20,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:20,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-08 09:41:20,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-08 09:41:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:20,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:21,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-08 09:41:21,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-08 09:41:21,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {548#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:21,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {548#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:21,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:21,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-08 09:41:21,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-08 09:41:21,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-08 09:41:21,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-08 09:41:21,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-08 09:41:21,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {477#true} is VALID [2022-04-08 09:41:21,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-08 09:41:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:41:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983055979] [2022-04-08 09:41:21,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480834114] [2022-04-08 09:41:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480834114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:21,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2022-04-08 09:41:21,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112010902] [2022-04-08 09:41:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112010902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:21,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:21,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:41:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027945211] [2022-04-08 09:41:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:41:21,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:21,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,613 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:41:21,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:41:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:41:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:41:21,614 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:21,796 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:41:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:41:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 09:41:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-08 09:41:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-08 09:41:21,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2022-04-08 09:41:21,816 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:41:21,817 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:41:21,817 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:41:21,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:41:21,818 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:21,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:41:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 09:41:21,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:21,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,831 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,831 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:21,832 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:41:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 09:41:21,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:21,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:21,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 09:41:21,833 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 09:41:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:21,834 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:41:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 09:41:21,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:21,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:21,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:21,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 09:41:21,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-08 09:41:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:21,835 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 09:41:21,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:21,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 09:41:21,851 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:41:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 09:41:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:41:21,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:21,851 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:21,870 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:41:22,067 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:41:22,068 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 5 times [2022-04-08 09:41:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:22,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703642655] [2022-04-08 09:41:22,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 6 times [2022-04-08 09:41:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:22,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025074807] [2022-04-08 09:41:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:22,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:22,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196290668] [2022-04-08 09:41:22,086 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:41:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:22,099 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:41:22,100 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:41:22,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:41:22,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:22,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 09:41:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:22,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:22,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-08 09:41:22,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {725#true} is VALID [2022-04-08 09:41:22,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-08 09:41:22,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-08 09:41:22,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-08 09:41:22,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {725#true} is VALID [2022-04-08 09:41:22,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-08 09:41:22,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {751#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:22,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {755#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:22,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {759#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-08 09:41:22,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {763#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-08 09:41:22,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:22,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:22,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} is VALID [2022-04-08 09:41:22,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:41:22,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} is VALID [2022-04-08 09:41:22,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:22,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-08 09:41:22,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-08 09:41:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:22,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:23,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-08 09:41:23,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-08 09:41:23,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:23,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {800#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:23,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:23,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-08 09:41:23,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {725#true} is VALID [2022-04-08 09:41:23,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-08 09:41:23,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-08 09:41:23,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-08 09:41:23,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {725#true} is VALID [2022-04-08 09:41:23,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-08 09:41:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 09:41:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025074807] [2022-04-08 09:41:23,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196290668] [2022-04-08 09:41:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196290668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:23,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2022-04-08 09:41:23,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703642655] [2022-04-08 09:41:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703642655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:23,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:41:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265405076] [2022-04-08 09:41:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:41:23,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:23,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,441 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:41:23,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:41:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:41:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:41:23,443 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:23,669 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:41:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:41:23,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 09:41:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 09:41:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 09:41:23,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-08 09:41:23,690 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:41:23,691 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:41:23,691 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:41:23,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:41:23,692 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:23,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:41:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 09:41:23,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:23,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,704 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,704 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:23,705 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:41:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:41:23,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:23,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:23,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 09:41:23,706 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 09:41:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:23,707 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:41:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:41:23,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:23,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:23,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:23,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-08 09:41:23,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-08 09:41:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:23,708 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-08 09:41:23,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:23,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-08 09:41:23,725 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:41:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:41:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:41:23,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:23,726 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:23,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:41:23,926 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:41:23,926 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 7 times [2022-04-08 09:41:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301045082] [2022-04-08 09:41:23,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 8 times [2022-04-08 09:41:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:23,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810700333] [2022-04-08 09:41:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:23,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:23,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942212839] [2022-04-08 09:41:23,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:23,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:23,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:23,960 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:41:23,960 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:41:23,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:41:23,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:23,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 09:41:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:24,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:24,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-08 09:41:24,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {986#true} is VALID [2022-04-08 09:41:24,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-08 09:41:24,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-08 09:41:24,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-08 09:41:24,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {986#true} is VALID [2022-04-08 09:41:24,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-08 09:41:24,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1012#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:24,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {1012#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1016#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:24,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1020#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:41:24,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {1020#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1024#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:24,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1028#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 09:41:24,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {1028#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1032#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-08 09:41:24,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1036#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-08 09:41:24,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {1036#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:41:24,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1044#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:41:24,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1044#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2022-04-08 09:41:24,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:24,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-08 09:41:24,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-08 09:41:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:24,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:25,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-08 09:41:25,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-08 09:41:25,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1065#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:25,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1065#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:25,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:25,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-08 09:41:25,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {986#true} is VALID [2022-04-08 09:41:25,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-08 09:41:25,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-08 09:41:25,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-08 09:41:25,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {986#true} is VALID [2022-04-08 09:41:25,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-08 09:41:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 09:41:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810700333] [2022-04-08 09:41:25,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942212839] [2022-04-08 09:41:25,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942212839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:25,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:25,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2022-04-08 09:41:25,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:25,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301045082] [2022-04-08 09:41:25,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301045082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:25,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:25,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 09:41:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213319072] [2022-04-08 09:41:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:41:25,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:25,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,653 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:41:25,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 09:41:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 09:41:25,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:41:25,654 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:25,939 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:41:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:41:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:41:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-08 09:41:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-08 09:41:25,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2022-04-08 09:41:25,960 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:41:25,960 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:41:25,960 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 09:41:25,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:41:25,961 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:25,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 09:41:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 09:41:25,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:25,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,975 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:25,976 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:41:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 09:41:25,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:25,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:25,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 09:41:25,976 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 09:41:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:25,977 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:41:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 09:41:25,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:25,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:25,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:25,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 09:41:25,978 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-08 09:41:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:25,978 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 09:41:25,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:25,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 09:41:25,997 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:41:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 09:41:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:41:25,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:25,998 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:26,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:41:26,207 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:41:26,207 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 9 times [2022-04-08 09:41:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:26,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013800511] [2022-04-08 09:41:26,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 10 times [2022-04-08 09:41:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:26,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705237403] [2022-04-08 09:41:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:26,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:26,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329537224] [2022-04-08 09:41:26,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:41:26,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:26,224 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:41:26,225 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:41:26,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:41:26,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:26,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 09:41:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:26,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:26,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 09:41:26,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1260#true} is VALID [2022-04-08 09:41:26,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 09:41:26,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-08 09:41:26,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-08 09:41:26,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1260#true} is VALID [2022-04-08 09:41:26,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-08 09:41:26,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1286#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:26,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1290#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:26,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1294#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:41:26,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {1294#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1298#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:26,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1302#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 09:41:26,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {1302#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:26,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:26,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1314#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 09:41:26,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 12))))} is VALID [2022-04-08 09:41:26,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1322#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 09:41:26,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {1322#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} is VALID [2022-04-08 09:41:26,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:26,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-08 09:41:26,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 09:41:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:26,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:27,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 09:41:27,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-08 09:41:27,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:27,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1343#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:27,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:27,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 09:41:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 09:41:27,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705237403] [2022-04-08 09:41:27,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329537224] [2022-04-08 09:41:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329537224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:27,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2022-04-08 09:41:27,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013800511] [2022-04-08 09:41:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013800511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 09:41:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227057596] [2022-04-08 09:41:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 09:41:27,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:27,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:27,962 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:41:27,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 09:41:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 09:41:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:41:27,963 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:28,235 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 09:41:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 09:41:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 09:41:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-08 09:41:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-08 09:41:28,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2022-04-08 09:41:28,262 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:41:28,262 INFO L225 Difference]: With dead ends: 26 [2022-04-08 09:41:28,262 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:41:28,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:41:28,263 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:28,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:41:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:41:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 09:41:28,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:28,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,280 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,280 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:28,281 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:41:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:41:28,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:28,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:28,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:41:28,281 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:41:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:28,282 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:41:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:41:28,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:28,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:28,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:28,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-08 09:41:28,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-08 09:41:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:28,283 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-08 09:41:28,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:28,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-08 09:41:28,303 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:41:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:41:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:41:28,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:28,304 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:28,326 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:41:28,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:28,523 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 11 times [2022-04-08 09:41:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997661185] [2022-04-08 09:41:28,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 12 times [2022-04-08 09:41:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559082266] [2022-04-08 09:41:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:28,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123622729] [2022-04-08 09:41:28,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:41:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:28,545 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:41:28,560 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:41:28,597 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:41:28,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:28,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 09:41:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:28,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:28,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1547#true} is VALID [2022-04-08 09:41:28,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-08 09:41:28,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1573#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:28,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1577#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:41:28,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {1577#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1581#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 09:41:28,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {1581#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1585#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:28,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1589#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 09:41:28,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {1589#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1593#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:28,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1597#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-08 09:41:28,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1601#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:41:28,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1605#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:28,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1609#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-08 09:41:28,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {1609#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1613#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:41:28,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1613#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1617#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2022-04-08 09:41:28,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:28,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-08 09:41:28,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-08 09:41:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:28,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:30,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-08 09:41:30,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-08 09:41:30,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:30,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1634#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:30,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:30,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-08 09:41:30,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-08 09:41:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 09:41:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559082266] [2022-04-08 09:41:30,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:30,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123622729] [2022-04-08 09:41:30,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123622729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:30,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:30,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2022-04-08 09:41:30,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:30,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997661185] [2022-04-08 09:41:30,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997661185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:30,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:30,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 09:41:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424716634] [2022-04-08 09:41:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:41:30,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:30,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,470 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:41:30,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 09:41:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:30,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 09:41:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:41:30,471 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:30,807 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:41:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 09:41:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 09:41:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-08 09:41:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-08 09:41:30,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2022-04-08 09:41:30,833 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:41:30,833 INFO L225 Difference]: With dead ends: 27 [2022-04-08 09:41:30,834 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:41:30,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:41:30,834 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:30,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:41:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:41:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 09:41:30,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:30,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,850 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,850 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:30,851 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:41:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:41:30,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:30,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:30,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:41:30,854 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:41:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:30,854 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:41:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:41:30,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:30,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:30,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:30,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 09:41:30,855 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-08 09:41:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:30,855 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 09:41:30,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:30,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 09:41:30,879 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:41:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:41:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:41:30,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:30,879 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:30,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 09:41:31,091 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:41:31,093 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 13 times [2022-04-08 09:41:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579912347] [2022-04-08 09:41:31,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 14 times [2022-04-08 09:41:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571429169] [2022-04-08 09:41:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:31,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821771464] [2022-04-08 09:41:31,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:31,165 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:41:31,166 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:41:31,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:41:31,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:31,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 09:41:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:31,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:31,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-08 09:41:31,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1847#true} is VALID [2022-04-08 09:41:31,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-08 09:41:31,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-08 09:41:31,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-08 09:41:31,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1847#true} is VALID [2022-04-08 09:41:31,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-08 09:41:31,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1873#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:31,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1877#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:41:31,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1881#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} is VALID [2022-04-08 09:41:31,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1881#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1885#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} is VALID [2022-04-08 09:41:31,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:31,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:41:31,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1897#(and (= 6 (+ main_~main__sum~0 (- 15))) (= 7 main_~main__i~0))} is VALID [2022-04-08 09:41:31,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(and (= 6 (+ main_~main__sum~0 (- 15))) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:41:31,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1905#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:41:31,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {1905#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1909#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:31,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {1909#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1913#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 09:41:31,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1913#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1917#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:31,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1917#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} is VALID [2022-04-08 09:41:31,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:31,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-08 09:41:31,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-08 09:41:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:31,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:33,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-08 09:41:33,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-08 09:41:33,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1938#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:33,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1938#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:33,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:33,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {1847#true} is VALID [2022-04-08 09:41:33,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-08 09:41:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 09:41:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571429169] [2022-04-08 09:41:33,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821771464] [2022-04-08 09:41:33,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821771464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:33,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2022-04-08 09:41:33,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579912347] [2022-04-08 09:41:33,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579912347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:33,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:33,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 09:41:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019012255] [2022-04-08 09:41:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:33,268 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 09:41:33,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:33,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,291 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:41:33,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 09:41:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 09:41:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:41:33,292 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:33,694 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:41:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 09:41:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 09:41:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-08 09:41:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-08 09:41:33,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2022-04-08 09:41:33,719 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:41:33,719 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:41:33,720 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:41:33,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:41:33,720 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:33,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:41:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:41:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 09:41:33,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:33,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,739 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,739 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:33,740 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:41:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:41:33,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:33,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:33,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 09:41:33,740 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 09:41:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:33,741 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:41:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:41:33,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:33,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:33,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:33,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 09:41:33,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-08 09:41:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:33,748 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 09:41:33,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:33,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 09:41:33,772 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:41:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:41:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 09:41:33,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:33,772 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:33,789 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:41:33,972 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:41:33,973 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 15 times [2022-04-08 09:41:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:33,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147199304] [2022-04-08 09:41:33,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 16 times [2022-04-08 09:41:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:33,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931918858] [2022-04-08 09:41:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:33,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683107614] [2022-04-08 09:41:33,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:41:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:33,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:33,989 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:41:33,990 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:41:34,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:41:34,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:34,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 09:41:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:34,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:34,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-08 09:41:34,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2160#true} is VALID [2022-04-08 09:41:34,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-08 09:41:34,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-08 09:41:34,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-08 09:41:34,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2160#true} is VALID [2022-04-08 09:41:34,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-08 09:41:34,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2186#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:34,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2186#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2190#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:41:34,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2194#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:41:34,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {2194#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2198#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:34,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {2198#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2202#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:41:34,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {2202#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2206#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 09:41:34,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2206#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2210#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 09:41:34,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2214#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:41:34,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2218#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-08 09:41:34,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2222#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:34,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {2222#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2226#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:41:34,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2230#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:41:34,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2234#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:41:34,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} is VALID [2022-04-08 09:41:34,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:34,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-08 09:41:34,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-08 09:41:34,379 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:41:34,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:36,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-08 09:41:36,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-08 09:41:36,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:36,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2255#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:36,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:36,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-08 09:41:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 09:41:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931918858] [2022-04-08 09:41:36,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683107614] [2022-04-08 09:41:36,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683107614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:36,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 19 [2022-04-08 09:41:36,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147199304] [2022-04-08 09:41:36,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147199304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:36,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 09:41:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149596593] [2022-04-08 09:41:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:36,059 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 09:41:36,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:36,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,080 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:41:36,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 09:41:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 09:41:36,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:41:36,081 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:36,500 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 09:41:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 09:41:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 09:41:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-08 09:41:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-08 09:41:36,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2022-04-08 09:41:36,524 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:41:36,525 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:41:36,525 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 09:41:36,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:41:36,525 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:36,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:41:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 09:41:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 09:41:36,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:36,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,551 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,551 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:36,551 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 09:41:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 09:41:36,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:36,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:36,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 09:41:36,552 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 09:41:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:36,552 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 09:41:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 09:41:36,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:36,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:36,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-08 09:41:36,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-08 09:41:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:36,554 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-08 09:41:36,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:36,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-08 09:41:36,583 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:41:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 09:41:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:41:36,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:36,583 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:36,600 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:41:36,794 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:41:36,794 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 17 times [2022-04-08 09:41:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:36,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408611538] [2022-04-08 09:41:36,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 18 times [2022-04-08 09:41:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:36,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580751895] [2022-04-08 09:41:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:36,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:36,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185317748] [2022-04-08 09:41:36,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:41:36,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:36,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:36,809 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:41:36,810 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:41:36,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 09:41:36,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:36,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 09:41:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:36,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:37,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-08 09:41:37,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2512#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:37,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {2512#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2516#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:41:37,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2520#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:41:37,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {2520#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2524#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:37,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2528#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-08 09:41:37,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {2528#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:37,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2536#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 09:41:37,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:41:37,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2544#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:41:37,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2548#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:37,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2552#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:41:37,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {2552#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2556#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:41:37,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {2556#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~0)) 45))} is VALID [2022-04-08 09:41:37,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~0)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:41:37,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2568#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} is VALID [2022-04-08 09:41:37,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {2568#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:37,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-08 09:41:37,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 09:41:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:37,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:39,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 09:41:39,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-08 09:41:39,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {2585#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:39,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2585#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:39,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:39,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 09:41:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 09:41:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:39,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580751895] [2022-04-08 09:41:39,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:39,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185317748] [2022-04-08 09:41:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185317748] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:39,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:39,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 20 [2022-04-08 09:41:39,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408611538] [2022-04-08 09:41:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408611538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:39,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:39,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 09:41:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016654453] [2022-04-08 09:41:39,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:39,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 09:41:39,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:39,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,399 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:41:39,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 09:41:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 09:41:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:41:39,400 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:39,913 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:41:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 09:41:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 09:41:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-08 09:41:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-08 09:41:39,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2022-04-08 09:41:39,942 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:41:39,943 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:41:39,943 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:41:39,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:41:39,943 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:39,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:41:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:41:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 09:41:39,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:39,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,972 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,973 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:39,974 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:41:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:41:39,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:39,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:39,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 09:41:39,974 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 09:41:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:39,975 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:41:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:41:39,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:39,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:39,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:39,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 09:41:39,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-08 09:41:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:39,976 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 09:41:39,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:39,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 09:41:40,004 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:41:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:41:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:41:40,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:40,006 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:40,022 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:41:40,222 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:41:40,223 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 19 times [2022-04-08 09:41:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:40,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005987263] [2022-04-08 09:41:40,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 20 times [2022-04-08 09:41:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:40,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197173821] [2022-04-08 09:41:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:40,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:40,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357968064] [2022-04-08 09:41:40,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:40,239 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:41:40,240 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:41:40,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:41:40,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:40,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 09:41:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:40,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:40,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-08 09:41:40,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2825#true} is VALID [2022-04-08 09:41:40,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-08 09:41:40,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-08 09:41:40,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-08 09:41:40,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2825#true} is VALID [2022-04-08 09:41:40,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-08 09:41:40,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2851#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:40,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2851#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2855#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:40,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2859#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:41:40,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {2859#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:41:40,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2867#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:41:40,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2871#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-08 09:41:40,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {2871#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2875#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:40,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2875#(and (= 5 (+ (- 2) main_~main__i~0)) (= (+ 8 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:41:40,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2883#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:41:40,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2887#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:40,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2891#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:40,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {2891#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2895#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:40,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {2895#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2899#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:40,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2903#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:40,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#(and (= (+ (* 3 main_~main__i~0) 36) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2907#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:41:40,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {2907#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 15 main_~main__n~0))} is VALID [2022-04-08 09:41:40,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 15 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:40,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-08 09:41:40,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-08 09:41:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:40,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:42,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-08 09:41:42,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-08 09:41:42,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {2928#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:42,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2928#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:42,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:42,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-08 09:41:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 09:41:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197173821] [2022-04-08 09:41:42,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357968064] [2022-04-08 09:41:42,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357968064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:42,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:42,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 21 [2022-04-08 09:41:42,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005987263] [2022-04-08 09:41:42,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005987263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:42,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:42,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 09:41:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784732080] [2022-04-08 09:41:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:42,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:41:42,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:42,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:42,874 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:41:42,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 09:41:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 09:41:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:41:42,875 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:43,416 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:41:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 09:41:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 09:41:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-08 09:41:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-08 09:41:43,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2022-04-08 09:41:43,446 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:41:43,446 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:41:43,446 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 09:41:43,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:41:43,447 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:43,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:41:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 09:41:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 09:41:43,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:43,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,473 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,473 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:43,474 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:41:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:41:43,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:43,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:43,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 09:41:43,474 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 09:41:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:43,475 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:41:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:41:43,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:43,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:43,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:43,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-08 09:41:43,476 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-08 09:41:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:43,476 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-08 09:41:43,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:43,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-08 09:41:43,507 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:41:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:41:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:41:43,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:43,507 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:43,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 09:41:43,715 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:41:43,715 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 21 times [2022-04-08 09:41:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:43,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105010902] [2022-04-08 09:41:43,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 22 times [2022-04-08 09:41:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:43,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638590650] [2022-04-08 09:41:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:43,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:43,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810644578] [2022-04-08 09:41:43,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:41:43,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:43,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:43,730 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:41:43,731 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:41:43,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:41:43,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:43,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 09:41:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:43,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:44,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-08 09:41:44,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-08 09:41:44,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3203#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:44,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3207#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:44,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3211#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:41:44,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3215#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:44,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {3215#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ (* 2 main_~main__i~0) (- 5)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:44,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 5 main_~main__i~0))))} is VALID [2022-04-08 09:41:44,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3227#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-08 09:41:44,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3231#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:41:44,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {3231#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3235#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:41:44,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3239#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:44,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3243#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 09:41:44,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {3243#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3247#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:41:44,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3251#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 09:41:44,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:41:44,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3259#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:41:44,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {3259#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3263#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} is VALID [2022-04-08 09:41:44,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {3263#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2022-04-08 09:41:44,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:44,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-08 09:41:44,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-08 09:41:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:44,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:46,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-08 09:41:46,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-08 09:41:46,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {3284#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:46,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3284#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:46,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:46,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3177#true} is VALID [2022-04-08 09:41:46,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-08 09:41:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 09:41:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638590650] [2022-04-08 09:41:46,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810644578] [2022-04-08 09:41:46,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810644578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:46,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:46,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5] total 22 [2022-04-08 09:41:46,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105010902] [2022-04-08 09:41:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105010902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:46,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:46,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 09:41:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168898358] [2022-04-08 09:41:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:46,771 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:41:46,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:46,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:46,793 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:41:46,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 09:41:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 09:41:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:41:46,794 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:47,421 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 09:41:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 09:41:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 09:41:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-08 09:41:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-08 09:41:47,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2022-04-08 09:41:47,451 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:41:47,451 INFO L225 Difference]: With dead ends: 32 [2022-04-08 09:41:47,451 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:41:47,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:41:47,452 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:47,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:41:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:41:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 09:41:47,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:47,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,482 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,482 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:47,483 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 09:41:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:41:47,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:47,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:47,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 09:41:47,483 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 09:41:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:47,484 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 09:41:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:41:47,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:47,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:47,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:47,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-08 09:41:47,485 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-08 09:41:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:47,485 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-08 09:41:47,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:47,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-08 09:41:47,513 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:41:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 09:41:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 09:41:47,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:47,513 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:47,533 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:41:47,714 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:41:47,714 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 23 times [2022-04-08 09:41:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:47,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236734390] [2022-04-08 09:41:47,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 24 times [2022-04-08 09:41:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:47,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021601693] [2022-04-08 09:41:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:47,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:47,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801539785] [2022-04-08 09:41:47,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:41:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:47,729 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:41:47,730 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:41:47,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 09:41:47,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:47,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 09:41:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:47,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:48,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3542#true} is VALID [2022-04-08 09:41:48,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-08 09:41:48,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3568#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:48,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3572#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:41:48,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {3572#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3576#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 09:41:48,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {3576#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3580#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:41:48,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3584#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-08 09:41:48,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {3584#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:48,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:48,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) main_~main__i~0) 4))} is VALID [2022-04-08 09:41:48,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:48,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 09:41:48,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:41:48,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:41:48,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3616#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-08 09:41:48,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {3616#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3620#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:48,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {3620#(and (= (+ (- 3) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 4) main_~main__i~0) 11))} is VALID [2022-04-08 09:41:48,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 4) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 5 main_~main__i~0))))} is VALID [2022-04-08 09:41:48,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 11))} is VALID [2022-04-08 09:41:48,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} is VALID [2022-04-08 09:41:48,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:48,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-08 09:41:48,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-08 09:41:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:48,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:51,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-08 09:41:51,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-08 09:41:51,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {3653#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:51,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3653#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:51,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:51,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-08 09:41:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 09:41:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021601693] [2022-04-08 09:41:51,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801539785] [2022-04-08 09:41:51,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801539785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:51,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:51,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 23 [2022-04-08 09:41:51,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236734390] [2022-04-08 09:41:51,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236734390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:51,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:51,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 09:41:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132910150] [2022-04-08 09:41:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:51,086 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 09:41:51,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:51,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,108 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:41:51,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 09:41:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 09:41:51,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:41:51,109 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:51,817 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:41:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 09:41:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 09:41:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-08 09:41:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-08 09:41:51,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2022-04-08 09:41:51,853 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:41:51,853 INFO L225 Difference]: With dead ends: 33 [2022-04-08 09:41:51,853 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 09:41:51,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:41:51,854 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:51,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 162 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:41:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 09:41:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 09:41:51,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:51,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,887 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,887 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:51,887 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:41:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:41:51,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:51,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:51,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 09:41:51,888 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 09:41:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:51,888 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:41:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:41:51,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:51,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:51,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:51,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-08 09:41:51,889 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-08 09:41:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:51,889 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-08 09:41:51,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:51,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-08 09:41:51,921 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:41:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:41:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:41:51,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:51,922 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:51,938 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:41:52,122 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:41:52,122 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 25 times [2022-04-08 09:41:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:52,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237253554] [2022-04-08 09:41:52,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 26 times [2022-04-08 09:41:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:52,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32864044] [2022-04-08 09:41:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:52,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:52,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397703558] [2022-04-08 09:41:52,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:41:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:52,154 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:41:52,156 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:41:52,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:41:52,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:52,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 09:41:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:52,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:52,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-08 09:41:52,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3946#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:52,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {3946#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3950#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:41:52,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3950#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3954#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:41:52,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {3954#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-08 09:41:52,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:52,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3966#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 09:41:52,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {3966#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3970#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 09:41:52,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {3970#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3974#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:41:52,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {3974#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3978#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:41:52,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3978#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3982#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:41:52,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {3982#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3986#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:52,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {3986#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3990#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:52,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {3990#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3994#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:52,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {3994#(and (= (+ 40 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3998#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-08 09:41:52,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {3998#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4002#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:41:52,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {4002#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-08 09:41:52,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:41:52,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} is VALID [2022-04-08 09:41:52,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 main_~main__n~0))} is VALID [2022-04-08 09:41:52,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:52,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-08 09:41:52,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-08 09:41:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:52,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:41:55,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-08 09:41:55,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-08 09:41:55,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {4035#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:55,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4035#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:41:55,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:41:55,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-08 09:41:55,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {3920#true} is VALID [2022-04-08 09:41:55,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-08 09:41:55,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-08 09:41:55,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-08 09:41:55,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {3920#true} is VALID [2022-04-08 09:41:55,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-08 09:41:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-08 09:41:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:41:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32864044] [2022-04-08 09:41:55,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:41:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397703558] [2022-04-08 09:41:55,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397703558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:41:55,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:41:55,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 24 [2022-04-08 09:41:55,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:41:55,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237253554] [2022-04-08 09:41:55,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237253554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:41:55,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:41:55,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 09:41:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615766764] [2022-04-08 09:41:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:41:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 09:41:55,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:41:55,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:55,933 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:41:55,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 09:41:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 09:41:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:41:55,934 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:56,770 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:41:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 09:41:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 09:41:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:41:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-08 09:41:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-08 09:41:56,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2022-04-08 09:41:56,805 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:41:56,806 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:41:56,806 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:41:56,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:41:56,807 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:41:56,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 09:41:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:41:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 09:41:56,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:41:56,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,831 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,831 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:56,831 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:41:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:41:56,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:56,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:56,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 09:41:56,832 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 09:41:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:41:56,832 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 09:41:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:41:56,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:41:56,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:41:56,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:41:56,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:41:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 09:41:56,833 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-08 09:41:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:41:56,833 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 09:41:56,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:41:56,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 09:41:56,866 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:41:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 09:41:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 09:41:56,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:41:56,867 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:41:56,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 09:41:57,075 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:41:57,075 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:41:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:41:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 27 times [2022-04-08 09:41:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:41:57,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847217405] [2022-04-08 09:41:57,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:41:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 28 times [2022-04-08 09:41:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:41:57,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975268217] [2022-04-08 09:41:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:41:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:41:57,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:41:57,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126091596] [2022-04-08 09:41:57,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:41:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:41:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:41:57,090 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:41:57,091 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:41:57,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:41:57,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:41:57,141 WARN L261 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-08 09:41:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:41:57,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:41:57,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-08 09:41:57,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4311#true} is VALID [2022-04-08 09:41:57,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-08 09:41:57,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-08 09:41:57,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-08 09:41:57,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4311#true} is VALID [2022-04-08 09:41:57,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-08 09:41:57,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4337#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:41:57,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4341#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:57,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {4341#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4345#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-08 09:41:57,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4349#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-08 09:41:57,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {4349#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4353#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 09:41:57,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {4353#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4357#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 09:41:57,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4361#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 09:41:57,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {4361#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4365#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:41:57,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4369#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:41:57,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4373#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 09:41:57,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {4373#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4377#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:41:57,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:41:57,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4385#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-08 09:41:57,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {4385#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4389#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:41:57,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {4389#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:41:57,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4397#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:41:57,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {4397#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4401#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:41:57,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {4401#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4405#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:41:57,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {4405#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-08 09:41:57,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 main_~main__n~0))} is VALID [2022-04-08 09:41:57,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:41:57,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-08 09:41:57,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-08 09:41:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:41:57,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:01,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-08 09:42:01,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-08 09:42:01,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {4430#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:01,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4430#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:01,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:01,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-08 09:42:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 09:42:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975268217] [2022-04-08 09:42:01,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126091596] [2022-04-08 09:42:01,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126091596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:01,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:01,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 25 [2022-04-08 09:42:01,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847217405] [2022-04-08 09:42:01,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847217405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:01,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:01,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 09:42:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430245798] [2022-04-08 09:42:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:42:01,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:01,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:01,138 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:42:01,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 09:42:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:01,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 09:42:01,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:42:01,139 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:02,108 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:42:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 09:42:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 09:42:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-08 09:42:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-08 09:42:02,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2022-04-08 09:42:02,145 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:42:02,146 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:42:02,146 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 09:42:02,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 19 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:42:02,146 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:02,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 09:42:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 09:42:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 09:42:02,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:02,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,178 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,178 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:02,179 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 09:42:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 09:42:02,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:02,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:02,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 09:42:02,179 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 09:42:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:02,179 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 09:42:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 09:42:02,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:02,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:02,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:02,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-08 09:42:02,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-08 09:42:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:02,180 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-08 09:42:02,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:02,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-08 09:42:02,235 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:42:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 09:42:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 09:42:02,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:02,236 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:02,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 09:42:02,436 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:42:02,436 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 29 times [2022-04-08 09:42:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:02,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518849061] [2022-04-08 09:42:02,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 30 times [2022-04-08 09:42:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:02,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071332762] [2022-04-08 09:42:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:02,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:02,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872238131] [2022-04-08 09:42:02,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:42:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:02,452 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:42:02,460 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:42:02,499 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 09:42:02,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:02,500 WARN L261 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-08 09:42:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:02,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:03,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-08 09:42:03,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4715#true} is VALID [2022-04-08 09:42:03,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-08 09:42:03,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-08 09:42:03,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-08 09:42:03,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4715#true} is VALID [2022-04-08 09:42:03,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4738#(<= 1 main_~main__n~0)} is VALID [2022-04-08 09:42:03,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {4738#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4742#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:03,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {4742#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4746#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:42:03,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4750#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:42:03,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {4750#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4754#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:42:03,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {4754#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 4)) 6))} is VALID [2022-04-08 09:42:03,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 4)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:42:03,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8))))} is VALID [2022-04-08 09:42:03,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} is VALID [2022-04-08 09:42:03,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:42:03,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:42:03,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} is VALID [2022-04-08 09:42:03,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:42:03,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4790#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-08 09:42:03,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {4790#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:03,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4798#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:42:03,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {4798#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4802#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-08 09:42:03,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {4802#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:03,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-08 09:42:03,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 09:42:03,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:42:03,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2022-04-08 09:42:03,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:03,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-08 09:42:03,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-08 09:42:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:03,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:04,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-08 09:42:04,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-08 09:42:04,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {4839#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:04,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4839#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:04,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {4847#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 09:42:04,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {4851#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4847#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {4855#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4851#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {4859#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4855#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {4863#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4859#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4863#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4867#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {4875#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4871#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4875#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {4883#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4879#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {4887#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4883#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {4891#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4887#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {4895#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4891#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4899#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4895#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {4903#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4899#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {4907#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4903#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {4911#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4907#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {4915#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4911#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {4919#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4915#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:42:04,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {4715#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4919#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:42:04,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {4715#true} is VALID [2022-04-08 09:42:04,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-08 09:42:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:04,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071332762] [2022-04-08 09:42:04,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:04,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872238131] [2022-04-08 09:42:04,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872238131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:04,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:04,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-04-08 09:42:04,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:04,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518849061] [2022-04-08 09:42:04,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518849061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:04,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:04,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 09:42:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031533474] [2022-04-08 09:42:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:04,299 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:42:04,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:04,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:04,330 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:42:04,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 09:42:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 09:42:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1557, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 09:42:04,332 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:05,537 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 09:42:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 09:42:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 09:42:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-08 09:42:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-08 09:42:05,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 36 transitions. [2022-04-08 09:42:05,581 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:42:05,581 INFO L225 Difference]: With dead ends: 36 [2022-04-08 09:42:05,582 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 09:42:05,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=519, Invalid=1643, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 09:42:05,582 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:05,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 109 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 09:42:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 09:42:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 09:42:05,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:05,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,618 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,618 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:05,619 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:42:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:42:05,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:05,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:05,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-08 09:42:05,619 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-08 09:42:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:05,620 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:42:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:42:05,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:05,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:05,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:05,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-08 09:42:05,622 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-08 09:42:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:05,622 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-08 09:42:05,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:05,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-08 09:42:05,667 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:42:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 09:42:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:42:05,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:05,668 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:05,684 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:42:05,868 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:42:05,868 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 31 times [2022-04-08 09:42:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413109107] [2022-04-08 09:42:05,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 32 times [2022-04-08 09:42:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788167286] [2022-04-08 09:42:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:05,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841569803] [2022-04-08 09:42:05,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:42:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:05,884 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:42:05,885 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:42:05,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:42:05,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:05,931 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 09:42:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:05,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:06,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5152#true} is VALID [2022-04-08 09:42:06,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-08 09:42:06,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5178#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:06,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {5178#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5182#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:42:06,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {5182#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5186#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:42:06,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {5186#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 1) main_~main__sum~0 (* (- 1) main_~main__i~0)) 1))} is VALID [2022-04-08 09:42:06,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 1) main_~main__sum~0 (* (- 1) main_~main__i~0)) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5194#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:42:06,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:06,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5202#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 09:42:06,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {5202#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5206#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:42:06,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {5206#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5210#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:42:06,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {5210#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5214#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 09:42:06,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {5214#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5218#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:42:06,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {5218#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5222#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} is VALID [2022-04-08 09:42:06,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {5222#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5226#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:42:06,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {5226#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5230#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-08 09:42:06,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {5230#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5234#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:06,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {5234#(and (= 12 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 61) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-08 09:42:06,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-08 09:42:06,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 12))} is VALID [2022-04-08 09:42:06,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 09:42:06,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5254#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:42:06,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {5254#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:06,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 21 main_~main__n~0))} is VALID [2022-04-08 09:42:06,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 21 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:06,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-08 09:42:06,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-08 09:42:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:06,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:10,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-08 09:42:10,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-08 09:42:10,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {5279#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:10,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5279#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:10,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:10,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5152#true} is VALID [2022-04-08 09:42:10,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-08 09:42:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 09:42:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:10,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788167286] [2022-04-08 09:42:10,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:10,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841569803] [2022-04-08 09:42:10,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841569803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:10,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:10,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5] total 27 [2022-04-08 09:42:10,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:10,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413109107] [2022-04-08 09:42:10,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413109107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:10,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:10,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 09:42:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773473814] [2022-04-08 09:42:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 09:42:10,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:10,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:10,557 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:42:10,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 09:42:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 09:42:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:42:10,558 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:11,767 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 09:42:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 09:42:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 09:42:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-08 09:42:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-08 09:42:11,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2022-04-08 09:42:11,805 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:42:11,805 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:42:11,805 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 09:42:11,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 21 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:42:11,806 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:11,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 09:42:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 09:42:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 09:42:11,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:11,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,833 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,833 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:11,834 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:42:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:42:11,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 09:42:11,834 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 09:42:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:11,835 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:42:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:42:11,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:11,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:11,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:11,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-08 09:42:11,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-08 09:42:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:11,836 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-08 09:42:11,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:11,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-08 09:42:11,883 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:42:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:42:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 09:42:11,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:11,883 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:11,900 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:42:12,094 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:42:12,095 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 33 times [2022-04-08 09:42:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:12,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204479669] [2022-04-08 09:42:12,095 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 34 times [2022-04-08 09:42:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005773471] [2022-04-08 09:42:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:12,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:12,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981439116] [2022-04-08 09:42:12,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:42:12,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:12,132 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:42:12,134 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:42:12,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:42:12,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:12,185 WARN L261 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 09:42:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:12,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-08 09:42:12,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5608#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:12,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {5608#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5612#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:42:12,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {5612#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5616#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:42:12,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {5616#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5620#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:42:12,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {5620#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5624#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:42:12,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {5624#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:12,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:42:12,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 6))))} is VALID [2022-04-08 09:42:12,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} is VALID [2022-04-08 09:42:12,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5644#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} is VALID [2022-04-08 09:42:12,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {5644#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5648#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 09:42:12,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {5648#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5652#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:42:12,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5656#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 09:42:12,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {5656#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5660#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:42:12,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {5660#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5664#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:42:12,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {5664#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5668#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:42:12,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {5668#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:42:12,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5676#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:12,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {5676#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5680#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 09:42:12,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5684#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 09:42:12,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {5684#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-08 09:42:12,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5692#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 09:42:12,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {5692#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} is VALID [2022-04-08 09:42:12,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:12,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-08 09:42:12,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 09:42:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:12,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:16,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 09:42:16,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-08 09:42:16,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:16,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5713#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:16,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:16,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 09:42:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 09:42:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005773471] [2022-04-08 09:42:16,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981439116] [2022-04-08 09:42:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981439116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:16,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 28 [2022-04-08 09:42:16,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204479669] [2022-04-08 09:42:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204479669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:16,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 09:42:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341141759] [2022-04-08 09:42:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 09:42:16,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:16,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:16,939 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:42:16,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 09:42:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 09:42:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:42:16,940 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:18,320 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 09:42:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 09:42:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 09:42:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-08 09:42:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-08 09:42:18,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2022-04-08 09:42:18,371 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:42:18,372 INFO L225 Difference]: With dead ends: 38 [2022-04-08 09:42:18,372 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:42:18,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:42:18,373 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:18,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 09:42:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:42:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 09:42:18,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:18,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,404 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,404 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:18,405 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:42:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:42:18,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:18,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:18,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 09:42:18,405 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 09:42:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:18,406 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:42:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:42:18,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:18,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:18,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:18,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-08 09:42:18,407 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-08 09:42:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:18,407 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-08 09:42:18,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:18,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-08 09:42:18,474 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:42:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 09:42:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 09:42:18,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:18,475 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:18,491 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:42:18,675 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:42:18,675 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 35 times [2022-04-08 09:42:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:18,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89025740] [2022-04-08 09:42:18,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 36 times [2022-04-08 09:42:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605006695] [2022-04-08 09:42:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:18,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:18,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858582745] [2022-04-08 09:42:18,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:42:18,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:18,691 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:42:18,695 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:42:18,743 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 09:42:18,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:18,745 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 09:42:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:18,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:19,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-08 09:42:19,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6051#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:19,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {6051#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6055#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:42:19,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {6055#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6059#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:42:19,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {6059#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:42:19,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6067#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:42:19,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6071#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 09:42:19,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {6071#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6075#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:19,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6079#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:19,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {6079#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:19,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 09:42:19,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6091#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} is VALID [2022-04-08 09:42:19,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6095#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 09:42:19,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6099#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-08 09:42:19,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {6099#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6103#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:42:19,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {6103#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6107#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-08 09:42:19,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {6107#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-08 09:42:19,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) main_~main__sum~0 (* (- 2) main_~main__i~0))))} is VALID [2022-04-08 09:42:19,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) main_~main__sum~0 (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:42:19,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:42:19,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 5) main_~main__i~0))))} is VALID [2022-04-08 09:42:19,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} is VALID [2022-04-08 09:42:19,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 09:42:19,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* main_~main__i~0 (- 8)))))} is VALID [2022-04-08 09:42:19,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* main_~main__i~0 (- 8)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ main_~main__sum~0 1)))} is VALID [2022-04-08 09:42:19,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ main_~main__sum~0 1)))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:19,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-08 09:42:19,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-08 09:42:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:19,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:25,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-08 09:42:25,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-08 09:42:25,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {6160#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:25,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6160#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:25,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:25,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6025#true} is VALID [2022-04-08 09:42:25,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-08 09:42:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 09:42:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605006695] [2022-04-08 09:42:25,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858582745] [2022-04-08 09:42:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858582745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:25,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:25,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 5] total 29 [2022-04-08 09:42:25,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89025740] [2022-04-08 09:42:25,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89025740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:25,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:25,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 09:42:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994368253] [2022-04-08 09:42:25,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:42:25,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:25,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:25,165 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:42:25,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 09:42:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:25,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 09:42:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:42:25,166 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:26,933 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 09:42:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 09:42:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 09:42:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-08 09:42:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-08 09:42:26,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2022-04-08 09:42:26,990 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:42:26,990 INFO L225 Difference]: With dead ends: 39 [2022-04-08 09:42:26,990 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 09:42:26,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:42:26,991 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:26,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 09:42:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 09:42:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 09:42:27,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:27,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:27,023 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:27,024 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:27,024 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 09:42:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 09:42:27,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:27,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:27,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 09:42:27,025 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 09:42:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:27,025 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 09:42:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 09:42:27,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:27,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:27,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:27,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-08 09:42:27,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-08 09:42:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:27,026 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-08 09:42:27,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:27,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-08 09:42:27,082 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:42:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 09:42:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 09:42:27,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:27,082 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:27,098 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:42:27,283 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:42:27,283 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 37 times [2022-04-08 09:42:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074594436] [2022-04-08 09:42:27,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 38 times [2022-04-08 09:42:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:27,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093277004] [2022-04-08 09:42:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:27,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:27,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251294452] [2022-04-08 09:42:27,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:42:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:27,298 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:42:27,300 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:42:27,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:42:27,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:27,351 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 09:42:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:27,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:27,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-08 09:42:27,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6507#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:27,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {6507#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6511#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:42:27,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {6511#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6515#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:42:27,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {6515#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6519#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:42:27,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6519#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6523#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:42:27,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 3 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:42:27,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 3 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 3 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:42:27,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 3 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6535#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:42:27,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {6535#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6539#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:42:27,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {6539#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6543#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 09:42:27,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {6543#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6547#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:42:27,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6551#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 09:42:27,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {6551#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6555#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:42:27,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6559#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:42:27,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {6559#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6563#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:42:27,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {6563#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} is VALID [2022-04-08 09:42:27,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6571#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:42:27,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {6571#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6575#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:27,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {6575#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-08 09:42:27,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6583#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:42:27,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {6583#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6587#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-08 09:42:27,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {6587#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 09:42:27,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-08 09:42:27,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 09:42:27,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 24 main_~main__n~0))} is VALID [2022-04-08 09:42:27,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 24 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:27,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-08 09:42:27,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-08 09:42:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:27,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:33,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-08 09:42:33,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-08 09:42:33,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {6620#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:33,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6620#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:33,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:33,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-08 09:42:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-08 09:42:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:33,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093277004] [2022-04-08 09:42:33,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251294452] [2022-04-08 09:42:33,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251294452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:33,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:33,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 30 [2022-04-08 09:42:33,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074594436] [2022-04-08 09:42:33,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074594436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:33,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:33,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 09:42:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975790142] [2022-04-08 09:42:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 09:42:33,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:33,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:33,424 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:42:33,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 09:42:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 09:42:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:42:33,425 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:35,436 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 09:42:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 09:42:35,436 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 09:42:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-08 09:42:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-08 09:42:35,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2022-04-08 09:42:35,484 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:42:35,485 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:42:35,485 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 09:42:35,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:42:35,486 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:35,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 09:42:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 09:42:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 09:42:35,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:35,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,518 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,518 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:35,518 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 09:42:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:42:35,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:35,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:35,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 09:42:35,519 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 09:42:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:35,519 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 09:42:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:42:35,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:35,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:35,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:35,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-08 09:42:35,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-08 09:42:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:35,520 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-08 09:42:35,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:35,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-08 09:42:35,585 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:42:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 09:42:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 09:42:35,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:35,586 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:35,601 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:42:35,786 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:42:35,786 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 39 times [2022-04-08 09:42:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700964180] [2022-04-08 09:42:35,787 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 40 times [2022-04-08 09:42:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865558299] [2022-04-08 09:42:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:35,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:35,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266232562] [2022-04-08 09:42:35,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:42:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:35,819 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:42:35,830 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:42:35,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:42:35,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:35,874 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 09:42:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:35,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:36,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-08 09:42:36,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6950#true} is VALID [2022-04-08 09:42:36,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-08 09:42:36,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-08 09:42:36,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-08 09:42:36,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6950#true} is VALID [2022-04-08 09:42:36,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-08 09:42:36,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6976#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:36,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {6976#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6980#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:42:36,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6984#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:36,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {6984#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 2)) (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6988#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:36,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {6988#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 4) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6992#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} is VALID [2022-04-08 09:42:36,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {6992#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6996#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 09:42:36,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {6996#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7000#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 09:42:36,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {7000#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:36,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {7004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:36,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 09:42:36,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:42:36,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) main_~main__sum~0) 28))} is VALID [2022-04-08 09:42:36,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) main_~main__sum~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 1) main_~main__i~0)) 28))} is VALID [2022-04-08 09:42:36,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 1) main_~main__i~0)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7028#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:42:36,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {7028#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7032#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:42:36,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {7032#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7036#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-08 09:42:36,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {7036#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7040#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:42:36,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {7040#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-08 09:42:36,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7048#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 09:42:36,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7052#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:42:36,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {7052#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7056#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 09:42:36,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {7056#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7060#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} is VALID [2022-04-08 09:42:36,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {7060#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7064#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-08 09:42:36,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {7064#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7068#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} is VALID [2022-04-08 09:42:36,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {7068#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-08 09:42:36,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2022-04-08 09:42:36,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:36,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-08 09:42:36,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-08 09:42:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:36,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:42,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-08 09:42:42,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-08 09:42:42,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {7093#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:42,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7093#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:42,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:42,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-08 09:42:42,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-08 09:42:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-08 09:42:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865558299] [2022-04-08 09:42:42,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266232562] [2022-04-08 09:42:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266232562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:42,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5] total 31 [2022-04-08 09:42:42,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700964180] [2022-04-08 09:42:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700964180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 09:42:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137418720] [2022-04-08 09:42:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 09:42:42,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:42,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:42,617 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:42:42,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 09:42:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 09:42:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:42:42,618 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:44,718 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 09:42:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 09:42:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-08 09:42:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-08 09:42:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-08 09:42:44,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2022-04-08 09:42:44,780 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:42:44,781 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:42:44,781 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 09:42:44,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-08 09:42:44,782 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:44,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 09:42:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 09:42:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 09:42:44,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:44,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,816 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,816 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:44,817 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 09:42:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 09:42:44,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:44,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:44,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 09:42:44,817 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 09:42:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:44,818 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 09:42:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 09:42:44,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:44,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:44,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:44,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-08 09:42:44,818 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-08 09:42:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:44,819 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-08 09:42:44,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:44,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-08 09:42:44,888 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:42:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 09:42:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 09:42:44,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:44,889 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:44,905 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:42:45,089 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:42:45,089 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 41 times [2022-04-08 09:42:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077726906] [2022-04-08 09:42:45,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 42 times [2022-04-08 09:42:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274796049] [2022-04-08 09:42:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:45,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754710540] [2022-04-08 09:42:45,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:42:45,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:45,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:45,120 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:42:45,120 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:42:45,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 09:42:45,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:45,170 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 09:42:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:45,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:45,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-08 09:42:45,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7458#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:45,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7462#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:42:45,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {7462#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7466#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:42:45,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {7466#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7470#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:42:45,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {7470#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7474#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:42:45,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {7474#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7478#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 09:42:45,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {7478#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7482#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:45,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7486#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 09:42:45,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {7486#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7490#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-08 09:42:45,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {7490#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7494#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:42:45,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {7494#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7498#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:42:45,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7502#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 09:42:45,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {7502#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:42:45,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:42:45,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:42:45,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7518#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:42:45,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {7518#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:42:45,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7526#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:42:45,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {7526#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7530#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 09:42:45,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {7530#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7534#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} is VALID [2022-04-08 09:42:45,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~0)) 153))} is VALID [2022-04-08 09:42:45,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~0)) 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7542#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-08 09:42:45,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {7542#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7546#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 09:42:45,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 09:42:45,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7554#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-08 09:42:45,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {7554#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7558#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-08 09:42:45,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 26 main_~main__n~0))} is VALID [2022-04-08 09:42:45,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:45,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-08 09:42:45,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-08 09:42:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:45,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:52,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-08 09:42:52,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-08 09:42:52,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {7579#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:52,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7579#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:42:52,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:42:52,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-08 09:42:52,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7432#true} is VALID [2022-04-08 09:42:52,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-08 09:42:52,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-08 09:42:52,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-08 09:42:52,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7432#true} is VALID [2022-04-08 09:42:52,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-08 09:42:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-08 09:42:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274796049] [2022-04-08 09:42:52,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:42:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754710540] [2022-04-08 09:42:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754710540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:52,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:42:52,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 32 [2022-04-08 09:42:52,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:52,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077726906] [2022-04-08 09:42:52,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077726906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:52,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:52,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 09:42:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231470960] [2022-04-08 09:42:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 09:42:52,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:52,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:53,000 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:42:53,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 09:42:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 09:42:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-04-08 09:42:53,002 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:55,364 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 09:42:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 09:42:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-08 09:42:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-08 09:42:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-08 09:42:55,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-04-08 09:42:55,422 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:42:55,422 INFO L225 Difference]: With dead ends: 42 [2022-04-08 09:42:55,422 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 09:42:55,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:42:55,424 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:55,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 09:42:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 09:42:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 09:42:55,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:55,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,469 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,469 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:55,469 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 09:42:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:42:55,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:55,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:55,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 09:42:55,470 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 09:42:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:55,470 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 09:42:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:42:55,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:55,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:55,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:55,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-08 09:42:55,471 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-08 09:42:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:55,471 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-08 09:42:55,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:42:55,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-08 09:42:55,550 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:42:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 09:42:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:42:55,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:55,551 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:55,571 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:42:55,751 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:42:55,751 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 43 times [2022-04-08 09:42:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:55,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1641716112] [2022-04-08 09:42:55,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:42:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 44 times [2022-04-08 09:42:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:55,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769689698] [2022-04-08 09:42:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:55,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:42:55,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380495374] [2022-04-08 09:42:55,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:42:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:55,766 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:42:55,767 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:42:55,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:42:55,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:55,817 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 09:42:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:55,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:56,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7927#true} is VALID [2022-04-08 09:42:56,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-08 09:42:56,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7953#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:42:56,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {7953#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7957#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:42:56,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {7957#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7961#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:42:56,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {7961#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7965#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:42:56,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7969#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:42:56,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {7969#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:42:56,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:42:56,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7981#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:42:56,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {7981#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7985#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:56,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {7985#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7989#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-08 09:42:56,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {7989#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:42:56,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7997#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:42:56,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {7997#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8001#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:42:56,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {8001#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8005#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:42:56,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {8005#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8009#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:42:56,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {8009#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8013#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:42:56,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {8013#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8017#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-08 09:42:56,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {8017#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8021#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 09:42:56,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {8021#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8025#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 09:42:56,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {8025#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8029#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 09:42:56,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {8029#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8033#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-08 09:42:56,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {8033#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8037#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} is VALID [2022-04-08 09:42:56,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {8037#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 09:42:56,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= main_~main__i~0 24))} is VALID [2022-04-08 09:42:56,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8049#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 09:42:56,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {8049#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8053#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 09:42:56,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {8053#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 09:42:56,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 09:42:56,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:42:56,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-08 09:42:56,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-08 09:42:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:56,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:43:04,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-08 09:43:04,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-08 09:43:04,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {8078#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:04,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8078#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:43:04,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:04,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-08 09:43:04,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {7927#true} is VALID [2022-04-08 09:43:04,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-08 09:43:04,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-08 09:43:04,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-08 09:43:04,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {7927#true} is VALID [2022-04-08 09:43:04,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-08 09:43:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-08 09:43:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:43:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769689698] [2022-04-08 09:43:04,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:43:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380495374] [2022-04-08 09:43:04,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380495374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:43:04,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:43:04,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 5] total 33 [2022-04-08 09:43:04,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:43:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1641716112] [2022-04-08 09:43:04,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1641716112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:43:04,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:43:04,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 09:43:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473555207] [2022-04-08 09:43:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:43:04,324 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:43:04,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:43:04,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:04,378 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:43:04,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 09:43:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 09:43:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 09:43:04,379 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:07,324 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 09:43:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 09:43:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-08 09:43:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:43:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-08 09:43:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-08 09:43:07,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2022-04-08 09:43:07,401 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:43:07,401 INFO L225 Difference]: With dead ends: 43 [2022-04-08 09:43:07,401 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 09:43:07,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:43:07,402 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:43:07,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 09:43:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 09:43:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 09:43:07,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:43:07,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,443 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,443 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:07,443 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 09:43:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 09:43:07,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:07,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:07,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-08 09:43:07,444 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-08 09:43:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:07,444 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 09:43:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 09:43:07,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:07,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:07,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:43:07,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:43:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-08 09:43:07,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-08 09:43:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:43:07,445 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-08 09:43:07,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:07,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-08 09:43:07,523 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:43:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 09:43:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 09:43:07,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:43:07,524 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:43:07,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 09:43:07,740 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:43:07,740 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:43:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:43:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 45 times [2022-04-08 09:43:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:07,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410790758] [2022-04-08 09:43:07,741 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:43:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 46 times [2022-04-08 09:43:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:43:07,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358463055] [2022-04-08 09:43:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:43:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:43:07,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:43:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045968777] [2022-04-08 09:43:07,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:43:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:43:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:43:07,757 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:43:07,758 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:43:07,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:43:07,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:43:07,820 WARN L261 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-08 09:43:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:43:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:43:08,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8435#true} is VALID [2022-04-08 09:43:08,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-08 09:43:08,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8461#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:43:08,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {8461#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8465#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:43:08,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {8465#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8469#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 09:43:08,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {8469#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:43:08,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8477#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:43:08,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {8477#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8481#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 09:43:08,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {8481#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8485#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 09:43:08,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {8485#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8489#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:43:08,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8493#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-08 09:43:08,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {8493#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8497#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 09:43:08,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {8497#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8501#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:43:08,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {8501#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8505#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 09:43:08,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {8505#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:43:08,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 18))))} is VALID [2022-04-08 09:43:08,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 15))))} is VALID [2022-04-08 09:43:08,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 15))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-08 09:43:08,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-08 09:43:08,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-08 09:43:08,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8533#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} is VALID [2022-04-08 09:43:08,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {8533#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8537#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:43:08,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {8537#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:43:08,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8545#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 09:43:08,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {8545#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8549#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-08 09:43:08,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 09:43:08,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} is VALID [2022-04-08 09:43:08,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8561#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 09:43:08,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {8561#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 09:43:08,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 09:43:08,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= main_~main__i~0 29))} is VALID [2022-04-08 09:43:08,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= main_~main__i~0 29))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:08,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-08 09:43:08,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-08 09:43:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:43:08,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:43:17,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-08 09:43:17,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-08 09:43:17,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {8590#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:17,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8590#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:43:17,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:17,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-08 09:43:17,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-08 09:43:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-04-08 09:43:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:43:17,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358463055] [2022-04-08 09:43:17,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:43:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045968777] [2022-04-08 09:43:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045968777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:43:17,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:43:17,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 5] total 34 [2022-04-08 09:43:17,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:43:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410790758] [2022-04-08 09:43:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410790758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:43:17,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:43:17,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 09:43:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936415359] [2022-04-08 09:43:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:43:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 09:43:17,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:43:17,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:17,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:43:17,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 09:43:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 09:43:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:43:17,455 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:21,009 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 09:43:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 09:43:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-08 09:43:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:43:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-08 09:43:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-08 09:43:21,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-08 09:43:21,076 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:43:21,076 INFO L225 Difference]: With dead ends: 44 [2022-04-08 09:43:21,076 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 09:43:21,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 09:43:21,077 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:43:21,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 09:43:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 09:43:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 09:43:21,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:43:21,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,113 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,113 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:21,114 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 09:43:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:43:21,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:21,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:21,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 09:43:21,114 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 09:43:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:21,115 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 09:43:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:43:21,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:21,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:21,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:43:21,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:43:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-08 09:43:21,116 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-08 09:43:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:43:21,116 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-08 09:43:21,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:21,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-08 09:43:21,194 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:43:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 09:43:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 09:43:21,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:43:21,195 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:43:21,212 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:43:21,395 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:43:21,395 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:43:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:43:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 47 times [2022-04-08 09:43:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:21,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771731385] [2022-04-08 09:43:21,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:43:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 48 times [2022-04-08 09:43:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:43:21,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048911777] [2022-04-08 09:43:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:43:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:43:21,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:43:21,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110481670] [2022-04-08 09:43:21,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:43:21,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:43:21,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:43:21,414 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:43:21,415 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:43:21,469 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 09:43:21,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:43:21,471 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-08 09:43:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:43:21,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:43:22,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-08 09:43:22,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8956#true} is VALID [2022-04-08 09:43:22,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-08 09:43:22,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-08 09:43:22,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-08 09:43:22,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8956#true} is VALID [2022-04-08 09:43:22,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8979#(<= 1 main_~main__n~0)} is VALID [2022-04-08 09:43:22,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {8979#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8983#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:43:22,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {8983#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:43:22,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9011#(and (<= 1 main_~main__n~0) (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:43:22,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {9011#(and (<= 1 main_~main__n~0) (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9015#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:43:22,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {9015#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9019#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 09:43:22,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {9019#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9023#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:43:22,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:43:22,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9031#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-08 09:43:22,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:43:22,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:43:22,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:43:22,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 09:43:22,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-08 09:43:22,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 09:43:22,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 19))))} is VALID [2022-04-08 09:43:22,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 19))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-08 09:43:22,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 63) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-08 09:43:22,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~0) (= main_~main__i~0 27))} is VALID [2022-04-08 09:43:22,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~0) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-08 09:43:22,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~0) (= 29 main_~main__i~0))} is VALID [2022-04-08 09:43:22,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~0) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 29 main_~main__n~0))} is VALID [2022-04-08 09:43:22,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:22,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-08 09:43:22,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-08 09:43:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:43:22,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:43:24,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-08 09:43:24,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-08 09:43:24,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:24,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9116#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:43:24,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {9124#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 09:43:24,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {9128#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9124#(or (<= (+ 2 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 1) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 4 main_~main__i~0) 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {9132#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9128#(or (= (+ (* main_~main__sum~0 2) (* 6 main_~main__i~0) 6) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 3 main_~main__i~0) main_~main__n~0) (not (<= (+ 2 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {9136#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9132#(or (not (<= (+ 3 main_~main__i~0) main_~main__n~0)) (<= (+ 4 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 8 main_~main__i~0) 12) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {9140#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9136#(or (<= (+ 5 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) 20 (* 10 main_~main__i~0))) (not (<= (+ 4 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {9144#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9140#(or (= (+ (* main_~main__sum~0 2) (* 12 main_~main__i~0) 30) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 6 main_~main__i~0) main_~main__n~0) (not (<= (+ 5 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {9148#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9144#(or (<= (+ 7 main_~main__i~0) main_~main__n~0) (not (<= (+ 6 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 14 main_~main__i~0) 42) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {9152#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9148#(or (= (+ (* main_~main__sum~0 2) 56 (* 16 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 8 main_~main__i~0) main_~main__n~0) (not (<= (+ 7 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {9156#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9152#(or (not (<= (+ 8 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 72 (* 18 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 9 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {9160#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9156#(or (not (<= (+ 9 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 20 main_~main__i~0) 90) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 10 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {9164#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9160#(or (<= (+ 11 main_~main__i~0) main_~main__n~0) (not (<= (+ 10 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 110 (* 22 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {9168#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9164#(or (not (<= (+ 11 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* main_~main__i~0 24) 132)) (<= (+ 12 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {9172#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9168#(or (<= (+ 13 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 26 main_~main__i~0) 156) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 12 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {9176#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9172#(or (= (+ (* main_~main__sum~0 2) (* 28 main_~main__i~0) 182) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 14 main_~main__i~0) main_~main__n~0) (not (<= (+ 13 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {9180#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9176#(or (not (<= (+ 14 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 30 main_~main__i~0) 210) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 15 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {9184#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9180#(or (not (<= (+ 15 main_~main__i~0) main_~main__n~0)) (= (+ (* 32 main_~main__i~0) (* main_~main__sum~0 2) 240) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 16 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {9188#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9184#(or (not (<= (+ 16 main_~main__i~0) main_~main__n~0)) (<= (+ 17 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 34 main_~main__i~0) 272) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {9192#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9188#(or (<= (+ 18 main_~main__i~0) main_~main__n~0) (not (<= (+ 17 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 306 (* 36 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {9196#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9192#(or (not (<= (+ 18 main_~main__i~0) main_~main__n~0)) (<= (+ 19 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) 342 (* 38 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {9200#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9196#(or (not (<= (+ 19 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) (* 40 main_~main__i~0) 380) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 20 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {9204#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9200#(or (<= (+ 21 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 42 main_~main__i~0) 420) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 20 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {9208#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9204#(or (not (<= (+ 21 main_~main__i~0) main_~main__n~0)) (<= (+ 22 main_~main__i~0) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* 44 main_~main__i~0) 462) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {9212#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9208#(or (= (+ (* main_~main__sum~0 2) (* 46 main_~main__i~0) 506) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 23 main_~main__i~0) main_~main__n~0) (not (<= (+ 22 main_~main__i~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {9216#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9212#(or (= (+ (* main_~main__sum~0 2) (* 48 main_~main__i~0) 552) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 23 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 24) main_~main__n~0))} is VALID [2022-04-08 09:43:24,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {9220#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9216#(or (= (+ (* main_~main__sum~0 2) 600 (* main_~main__i~0 50)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= (+ 25 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 24) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {9224#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9220#(or (= (+ (* main_~main__sum~0 2) 650 (* 52 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (not (<= (+ 25 main_~main__i~0) main_~main__n~0)) (<= (+ 26 main_~main__i~0) main_~main__n~0))} is VALID [2022-04-08 09:43:24,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {9228#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9224#(or (not (<= (+ 26 main_~main__i~0) main_~main__n~0)) (<= (+ main_~main__i~0 27) main_~main__n~0) (= (+ (* main_~main__sum~0 2) (* main_~main__i~0 54) 702) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {9232#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9228#(or (<= (+ 28 main_~main__i~0) main_~main__n~0) (not (<= (+ main_~main__i~0 27) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 756 (* 56 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {8956#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9232#(or (<= (+ 29 main_~main__i~0) main_~main__n~0) (not (<= (+ 28 main_~main__i~0) main_~main__n~0)) (= (+ (* main_~main__sum~0 2) 812 (* 58 main_~main__i~0)) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)))} is VALID [2022-04-08 09:43:24,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8956#true} is VALID [2022-04-08 09:43:24,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {8956#true} is VALID [2022-04-08 09:43:24,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-08 09:43:24,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-08 09:43:24,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-08 09:43:24,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {8956#true} is VALID [2022-04-08 09:43:24,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-08 09:43:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:43:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:43:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048911777] [2022-04-08 09:43:24,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:43:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110481670] [2022-04-08 09:43:24,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110481670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:43:24,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:43:24,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2022-04-08 09:43:24,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:43:24,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771731385] [2022-04-08 09:43:24,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771731385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:43:24,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:43:24,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 09:43:24,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701657491] [2022-04-08 09:43:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:43:24,739 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 09:43:24,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:43:24,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:24,798 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:43:24,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 09:43:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 09:43:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=3033, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 09:43:24,800 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:29,600 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 09:43:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 09:43:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-08 09:43:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:43:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 09:43:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 09:43:29,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 09:43:29,678 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:43:29,678 INFO L225 Difference]: With dead ends: 45 [2022-04-08 09:43:29,678 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 09:43:29,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1005, Invalid=3155, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 09:43:29,679 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:43:29,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 217 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 09:43:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 09:43:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 09:43:29,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:43:29,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,719 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,719 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:29,719 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 09:43:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 09:43:29,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:29,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:29,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 09:43:29,720 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 09:43:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:29,720 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 09:43:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 09:43:29,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:29,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:29,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:43:29,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:43:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-08 09:43:29,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-08 09:43:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:43:29,721 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-08 09:43:29,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:29,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-08 09:43:29,817 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:43:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 09:43:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 09:43:29,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:43:29,817 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:43:29,835 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:43:30,018 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:43:30,018 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:43:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:43:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 49 times [2022-04-08 09:43:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384801587] [2022-04-08 09:43:30,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:43:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 50 times [2022-04-08 09:43:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:43:30,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082937341] [2022-04-08 09:43:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:43:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:43:30,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:43:30,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544873033] [2022-04-08 09:43:30,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:43:30,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:43:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:43:30,034 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:43:30,035 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:43:30,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:43:30,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:43:30,085 WARN L261 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-08 09:43:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:43:30,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:43:30,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-08 09:43:30,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9545#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:43:30,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {9545#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9549#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:43:30,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {9549#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9553#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:43:30,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {9553#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9557#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:43:30,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {9557#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9561#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 09:43:30,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {9561#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9565#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 09:43:30,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {9565#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:43:30,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9573#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:43:30,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {9573#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:43:30,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) main_~main__sum~0))} is VALID [2022-04-08 09:43:30,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 09:43:30,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:43:30,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 09:43:30,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9597#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:43:30,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {9597#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:43:30,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9605#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:43:30,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {9605#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:43:30,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 09:43:30,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} is VALID [2022-04-08 09:43:30,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} is VALID [2022-04-08 09:43:30,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9625#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 09:43:30,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {9625#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9629#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-08 09:43:30,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {9629#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9633#(and (= 21 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} is VALID [2022-04-08 09:43:30,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#(and (= 21 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 09:43:30,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9641#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-08 09:43:30,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {9641#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9645#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 09:43:30,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {9645#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-08 09:43:30,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9653#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-08 09:43:30,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {9653#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 09:43:30,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-08 09:43:30,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9665#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} is VALID [2022-04-08 09:43:30,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {9665#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:30,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-08 09:43:30,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-08 09:43:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:43:30,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:43:41,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-08 09:43:41,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-08 09:43:41,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {9682#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:41,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9682#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:43:41,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:41,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:43:42,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-08 09:43:42,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {9519#true} is VALID [2022-04-08 09:43:42,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-08 09:43:42,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-08 09:43:42,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-08 09:43:42,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {9519#true} is VALID [2022-04-08 09:43:42,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-08 09:43:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-08 09:43:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:43:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082937341] [2022-04-08 09:43:42,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:43:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544873033] [2022-04-08 09:43:42,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544873033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:43:42,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:43:42,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5] total 36 [2022-04-08 09:43:42,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:43:42,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384801587] [2022-04-08 09:43:42,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384801587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:43:42,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:43:42,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 09:43:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359549723] [2022-04-08 09:43:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:43:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 09:43:42,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:43:42,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:42,299 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:43:42,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 09:43:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 09:43:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 09:43:42,300 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:47,359 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:43:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 09:43:47,359 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-08 09:43:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:43:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 09:43:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 09:43:47,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-08 09:43:47,437 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:43:47,438 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:43:47,438 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 09:43:47,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 09:43:47,438 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:43:47,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 266 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 09:43:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 09:43:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 09:43:47,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:43:47,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,478 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,478 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:47,478 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 09:43:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:43:47,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:47,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:47,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 09:43:47,479 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 09:43:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:43:47,479 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 09:43:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:43:47,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:43:47,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:43:47,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:43:47,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:43:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-08 09:43:47,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-08 09:43:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:43:47,480 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-08 09:43:47,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:43:47,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-08 09:43:47,589 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:43:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 09:43:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 09:43:47,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:43:47,590 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:43:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-08 09:43:47,790 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:43:47,790 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:43:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:43:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 51 times [2022-04-08 09:43:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:43:47,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334698373] [2022-04-08 09:43:47,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:43:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 52 times [2022-04-08 09:43:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:43:47,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521697572] [2022-04-08 09:43:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:43:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:43:47,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:43:47,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381042240] [2022-04-08 09:43:47,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:43:47,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:43:47,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:43:47,808 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:43:47,808 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:43:47,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:43:47,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:43:47,867 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-08 09:43:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:43:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:43:48,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-08 09:43:48,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10066#true} is VALID [2022-04-08 09:43:48,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-08 09:43:48,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-08 09:43:48,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-08 09:43:48,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10066#true} is VALID [2022-04-08 09:43:48,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-08 09:43:48,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:43:48,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {10092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10096#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:43:48,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {10096#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:43:48,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {10100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:43:48,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {10104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10108#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 09:43:48,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {10108#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10112#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-08 09:43:48,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {10112#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10116#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-08 09:43:48,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {10116#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10120#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:43:48,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {10120#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10124#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:43:48,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10128#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 09:43:48,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {10128#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10132#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:43:48,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {10132#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10136#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:43:48,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {10136#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10140#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-08 09:43:48,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {10140#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10144#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:43:48,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {10144#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:43:48,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:43:48,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10156#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} is VALID [2022-04-08 09:43:48,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {10156#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10160#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} is VALID [2022-04-08 09:43:48,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {10160#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-08 09:43:48,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10168#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:43:48,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {10168#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-08 09:43:48,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} is VALID [2022-04-08 09:43:48,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:43:48,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} is VALID [2022-04-08 09:43:48,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:43:48,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10192#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 09:43:48,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {10192#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-08 09:43:48,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10200#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-08 09:43:48,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {10200#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10204#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 09:43:48,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {10204#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10208#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-08 09:43:48,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {10208#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10212#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} is VALID [2022-04-08 09:43:48,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {10212#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:43:48,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 main_~main__i~0) main_~main__sum~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:43:48,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-08 09:43:48,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-08 09:43:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:43:48,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:02,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-08 09:44:02,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-08 09:44:02,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {10233#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:44:02,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10233#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:44:02,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:02,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10066#true} is VALID [2022-04-08 09:44:02,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-08 09:44:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-08 09:44:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521697572] [2022-04-08 09:44:02,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381042240] [2022-04-08 09:44:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381042240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:02,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:02,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 5] total 37 [2022-04-08 09:44:02,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334698373] [2022-04-08 09:44:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334698373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:02,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 09:44:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469162208] [2022-04-08 09:44:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:44:02,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:02,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:02,755 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:02,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 09:44:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 09:44:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 09:44:02,756 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:09,871 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 09:44:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 09:44:09,871 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 09:44:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-08 09:44:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-08 09:44:09,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-08 09:44:09,969 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:44:09,969 INFO L225 Difference]: With dead ends: 47 [2022-04-08 09:44:09,969 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:44:09,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 09:44:09,970 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:09,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 09:44:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:44:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 09:44:10,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:10,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,010 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,010 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:10,011 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 09:44:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 09:44:10,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:10,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:10,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 09:44:10,011 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 09:44:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:10,012 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 09:44:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 09:44:10,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:10,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:10,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:10,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-08 09:44:10,013 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-08 09:44:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:10,013 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-08 09:44:10,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:10,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-08 09:44:10,207 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:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 09:44:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 09:44:10,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:10,208 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:10,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 09:44:10,408 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:44:10,408 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 53 times [2022-04-08 09:44:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1170645931] [2022-04-08 09:44:10,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:44:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 54 times [2022-04-08 09:44:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167623501] [2022-04-08 09:44:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:10,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610819521] [2022-04-08 09:44:10,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:44:10,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:10,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:10,426 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:44:10,427 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:44:10,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 09:44:10,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:10,490 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 09:44:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:10,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:11,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-08 09:44:11,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10626#true} is VALID [2022-04-08 09:44:11,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 09:44:11,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-08 09:44:11,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-08 09:44:11,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10626#true} is VALID [2022-04-08 09:44:11,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-08 09:44:11,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10652#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:44:11,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {10652#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10656#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:44:11,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10660#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:44:11,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10664#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:44:11,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {10664#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10668#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 09:44:11,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {10668#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10672#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 09:44:11,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {10672#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10676#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:44:11,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {10676#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10680#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 09:44:11,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {10680#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10684#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-08 09:44:11,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {10684#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-08 09:44:11,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} is VALID [2022-04-08 09:44:11,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 30)))} is VALID [2022-04-08 09:44:11,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 30)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10700#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 09:44:11,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {10700#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:44:11,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10708#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} is VALID [2022-04-08 09:44:11,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {10708#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10712#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:44:11,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {10712#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10716#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-08 09:44:11,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {10716#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10720#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 09:44:11,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {10720#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 09:44:11,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-08 09:44:11,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10732#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} is VALID [2022-04-08 09:44:11,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {10732#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10736#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-08 09:44:11,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {10736#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10740#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-08 09:44:11,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {10740#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10744#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 09:44:11,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {10744#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10748#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-08 09:44:11,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {10748#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} is VALID [2022-04-08 09:44:11,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 09:44:11,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 26))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10760#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 09:44:11,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {10760#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10764#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 09:44:11,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {10764#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10768#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-08 09:44:11,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {10768#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10772#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-08 09:44:11,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10776#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} is VALID [2022-04-08 09:44:11,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {10776#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} is VALID [2022-04-08 09:44:11,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:44:11,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-08 09:44:11,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-08 09:44:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:11,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:26,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-08 09:44:26,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-08 09:44:26,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {10797#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:44:26,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10797#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:44:26,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:26,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-08 09:44:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2022-04-08 09:44:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:26,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167623501] [2022-04-08 09:44:26,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610819521] [2022-04-08 09:44:26,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610819521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:26,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:26,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5] total 38 [2022-04-08 09:44:26,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1170645931] [2022-04-08 09:44:26,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1170645931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:26,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:26,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 09:44:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156053799] [2022-04-08 09:44:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 09:44:26,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:26,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:27,070 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:44:27,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 09:44:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 09:44:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 09:44:27,071 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:34,947 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 09:44:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 09:44:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 09:44:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:44:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 09:44:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 09:44:34,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-08 09:44:35,070 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:44:35,071 INFO L225 Difference]: With dead ends: 48 [2022-04-08 09:44:35,071 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 09:44:35,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 09:44:35,072 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:44:35,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 09:44:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 09:44:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 09:44:35,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:44:35,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:35,113 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:35,114 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:35,114 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 09:44:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:44:35,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:35,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:35,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 09:44:35,115 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 09:44:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:44:35,115 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 09:44:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:44:35,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:44:35,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:44:35,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:44:35,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:44:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-08 09:44:35,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-08 09:44:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:44:35,116 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-08 09:44:35,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:35,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-08 09:44:35,369 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:44:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:44:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 09:44:35,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:44:35,370 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:44:35,386 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:44:35,570 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:44:35,570 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:44:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:44:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 55 times [2022-04-08 09:44:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:35,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854444178] [2022-04-08 09:44:35,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:44:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 56 times [2022-04-08 09:44:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:44:35,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279702708] [2022-04-08 09:44:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:44:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:44:35,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:44:35,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291573121] [2022-04-08 09:44:35,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:44:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:44:35,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:44:35,591 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:44:35,594 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:44:35,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:44:35,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:44:35,647 WARN L261 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-08 09:44:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:44:35,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:44:36,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11199#true} is VALID [2022-04-08 09:44:36,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-08 09:44:36,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11225#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:44:36,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {11225#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11229#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:44:36,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {11229#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11233#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:44:36,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {11233#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11237#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:44:36,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {11237#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11241#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 09:44:36,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {11241#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:44:36,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:44:36,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11253#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:44:36,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:44:36,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 09:44:36,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11265#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:44:36,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {11265#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11269#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 09:44:36,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {11269#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11273#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 09:44:36,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {11273#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11277#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-08 09:44:36,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {11277#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-08 09:44:36,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11285#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:44:36,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {11285#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:44:36,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11293#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-08 09:44:36,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {11293#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11297#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-08 09:44:36,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {11297#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} is VALID [2022-04-08 09:44:36,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-08 09:44:36,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11309#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 09:44:36,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {11309#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11313#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-08 09:44:36,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {11313#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11317#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 09:44:36,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {11317#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11321#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-08 09:44:36,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {11321#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11325#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:44:36,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {11325#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11329#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} is VALID [2022-04-08 09:44:36,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {11329#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 09:44:36,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 09:44:36,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11341#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-08 09:44:36,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {11341#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11345#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 09:44:36,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {11345#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11349#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-08 09:44:36,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {11349#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11353#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-08 09:44:36,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {11353#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2022-04-08 09:44:36,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:44:36,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-08 09:44:36,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-08 09:44:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:44:36,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:44:54,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-08 09:44:54,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-08 09:44:54,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {11374#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:44:54,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11374#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:44:54,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:54,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:54,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:54,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:54,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:54,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:44:55,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-08 09:44:55,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11199#true} is VALID [2022-04-08 09:44:55,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-08 09:44:55,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-08 09:44:55,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-08 09:44:55,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11199#true} is VALID [2022-04-08 09:44:55,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-08 09:44:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-08 09:44:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:44:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279702708] [2022-04-08 09:44:55,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:44:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291573121] [2022-04-08 09:44:55,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291573121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:44:55,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:44:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 5] total 39 [2022-04-08 09:44:55,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:44:55,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854444178] [2022-04-08 09:44:55,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854444178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:44:55,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:44:55,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 09:44:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085584609] [2022-04-08 09:44:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:44:55,449 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:44:55,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:44:55,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:44:55,556 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:55,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 09:44:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:44:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 09:44:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 09:44:55,558 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:03,174 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 09:45:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 09:45:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 09:45:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-08 09:45:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-08 09:45:03,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-08 09:45:03,284 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:03,285 INFO L225 Difference]: With dead ends: 49 [2022-04-08 09:45:03,285 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 09:45:03,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 33 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 09:45:03,286 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:03,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 09:45:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 09:45:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 09:45:03,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:03,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,331 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,331 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:03,331 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:45:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 09:45:03,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:03,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:03,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 09:45:03,332 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 09:45:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:03,332 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:45:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 09:45:03,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:03,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:03,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:03,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-08 09:45:03,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-08 09:45:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:03,333 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-08 09:45:03,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:03,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-08 09:45:03,488 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:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 09:45:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 09:45:03,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:03,489 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:03,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-08 09:45:03,699 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:45:03,699 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 57 times [2022-04-08 09:45:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:03,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945480815] [2022-04-08 09:45:03,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:45:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 58 times [2022-04-08 09:45:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:03,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20006824] [2022-04-08 09:45:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:03,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:03,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372677214] [2022-04-08 09:45:03,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:45:03,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:03,716 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:45:03,717 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:45:03,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:45:03,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:03,788 WARN L261 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-08 09:45:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:03,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:04,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-08 09:45:04,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11811#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:45:04,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11815#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:45:04,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {11815#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11819#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 09:45:04,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {11819#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11823#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} is VALID [2022-04-08 09:45:04,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {11823#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11827#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} is VALID [2022-04-08 09:45:04,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11831#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-08 09:45:04,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11835#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-08 09:45:04,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {11835#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11839#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 09:45:04,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {11839#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11843#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:45:04,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {11843#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11847#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 09:45:04,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {11847#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 10))} is VALID [2022-04-08 09:45:04,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-08 09:45:04,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 51) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11859#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:45:04,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {11859#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11863#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:45:04,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {11863#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:45:04,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11871#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:45:04,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {11871#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11875#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:45:04,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {11875#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} is VALID [2022-04-08 09:45:04,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-08 09:45:04,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11887#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 09:45:04,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {11887#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-08 09:45:04,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} is VALID [2022-04-08 09:45:04,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-08 09:45:04,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11903#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-08 09:45:04,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {11903#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11907#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 09:45:04,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {11907#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11911#(and (= (+ (- 1) main_~main__i~0) 25) (= main_~main__sum~0 (+ 299 main_~main__i~0)))} is VALID [2022-04-08 09:45:04,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {11911#(and (= (+ (- 1) main_~main__i~0) 25) (= main_~main__sum~0 (+ 299 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 25))} is VALID [2022-04-08 09:45:04,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 25))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11919#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 09:45:04,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {11919#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11923#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 09:45:04,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {11923#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11927#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-08 09:45:04,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {11927#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11931#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 09:45:04,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {11931#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11935#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-08 09:45:04,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {11935#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11939#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-08 09:45:04,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {11939#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11943#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} is VALID [2022-04-08 09:45:04,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {11943#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= main_~main__i~0 35))} is VALID [2022-04-08 09:45:04,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= main_~main__i~0 35))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:45:04,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-08 09:45:04,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-08 09:45:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:04,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:23,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-08 09:45:23,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-08 09:45:23,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {11964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:45:23,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11964#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:45:23,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:23,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:24,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-08 09:45:24,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {11785#true} is VALID [2022-04-08 09:45:24,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-08 09:45:24,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-08 09:45:24,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-08 09:45:24,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {11785#true} is VALID [2022-04-08 09:45:24,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-08 09:45:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2022-04-08 09:45:24,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:24,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20006824] [2022-04-08 09:45:24,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372677214] [2022-04-08 09:45:24,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372677214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:24,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 5] total 40 [2022-04-08 09:45:24,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945480815] [2022-04-08 09:45:24,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945480815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:24,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 09:45:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256827056] [2022-04-08 09:45:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:24,370 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 09:45:24,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:24,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:24,463 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:24,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 09:45:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:24,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 09:45:24,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 09:45:24,464 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:33,818 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 09:45:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 09:45:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 09:45:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:45:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-08 09:45:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-08 09:45:33,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-08 09:45:33,931 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:33,932 INFO L225 Difference]: With dead ends: 50 [2022-04-08 09:45:33,932 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 09:45:33,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 09:45:33,933 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:45:33,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 298 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 09:45:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 09:45:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 09:45:33,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:45:33,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,980 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:33,980 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 09:45:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:33,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:33,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:33,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 09:45:33,981 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 09:45:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:45:33,981 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 09:45:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:33,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:45:33,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:45:33,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:45:33,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:45:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-08 09:45:33,982 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-08 09:45:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:45:33,982 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-08 09:45:33,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:33,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-08 09:45:34,163 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:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 09:45:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 09:45:34,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:45:34,164 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:45:34,180 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:45:34,364 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:45:34,364 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:45:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:45:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 59 times [2022-04-08 09:45:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:34,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [528728310] [2022-04-08 09:45:34,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:45:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 60 times [2022-04-08 09:45:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:45:34,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767579437] [2022-04-08 09:45:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:45:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:45:34,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:45:34,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244565563] [2022-04-08 09:45:34,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:45:34,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:45:34,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:45:34,384 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:45:34,396 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:45:34,450 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 09:45:34,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:45:34,453 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-08 09:45:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:45:34,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:45:35,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12384#true} is VALID [2022-04-08 09:45:35,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-08 09:45:35,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12410#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:45:35,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {12410#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12414#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 09:45:35,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {12414#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12418#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:45:35,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {12418#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12422#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:45:35,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {12422#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:45:35,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 09:45:35,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:45:35,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:45:35,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:45:35,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12446#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:45:35,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {12446#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12450#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 09:45:35,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12454#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 09:45:35,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {12454#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:45:35,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:45:35,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12466#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-08 09:45:35,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {12466#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-08 09:45:35,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:45:35,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12478#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 09:45:35,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {12478#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 09:45:35,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12486#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 09:45:35,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {12486#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} is VALID [2022-04-08 09:45:35,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12494#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} is VALID [2022-04-08 09:45:35,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {12494#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 09:45:35,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 22))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12502#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-08 09:45:35,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 24))} is VALID [2022-04-08 09:45:35,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12510#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} is VALID [2022-04-08 09:45:35,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:45:35,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 09:45:35,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 09:45:35,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} is VALID [2022-04-08 09:45:35,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~0) 30))} is VALID [2022-04-08 09:45:35,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~0) 30))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 32 main_~main__i~0))} is VALID [2022-04-08 09:45:35,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 32 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} is VALID [2022-04-08 09:45:35,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} is VALID [2022-04-08 09:45:35,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12546#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} is VALID [2022-04-08 09:45:35,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {12546#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 main_~main__n~0))} is VALID [2022-04-08 09:45:35,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:45:35,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-08 09:45:35,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-08 09:45:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:45:35,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:45:57,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-08 09:45:57,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-08 09:45:57,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {12567#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:45:57,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12567#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:45:57,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:57,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:57,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:57,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:57,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:45:58,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-08 09:45:58,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12384#true} is VALID [2022-04-08 09:45:58,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-08 09:45:58,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-08 09:45:58,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-08 09:45:58,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12384#true} is VALID [2022-04-08 09:45:58,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-08 09:45:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-08 09:45:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:45:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767579437] [2022-04-08 09:45:58,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:45:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244565563] [2022-04-08 09:45:58,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244565563] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:45:58,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:45:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 5] total 41 [2022-04-08 09:45:58,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:45:58,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [528728310] [2022-04-08 09:45:58,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [528728310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:45:58,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:45:58,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 09:45:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687313920] [2022-04-08 09:45:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:45:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 09:45:58,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:45:58,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:45:58,650 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:58,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 09:45:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:45:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 09:45:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 09:45:58,651 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:09,874 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:46:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 09:46:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-08 09:46:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:46:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-08 09:46:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-08 09:46:09,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2022-04-08 09:46:10,110 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:46:10,111 INFO L225 Difference]: With dead ends: 51 [2022-04-08 09:46:10,111 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 09:46:10,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 09:46:10,112 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:46:10,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-08 09:46:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 09:46:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 09:46:10,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:46:10,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,164 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,165 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:10,165 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 09:46:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 09:46:10,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:10,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:10,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 09:46:10,166 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 09:46:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:46:10,166 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 09:46:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 09:46:10,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:46:10,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:46:10,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:46:10,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:46:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-08 09:46:10,167 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-08 09:46:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:46:10,167 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-08 09:46:10,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:10,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-08 09:46:10,468 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:46:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 09:46:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 09:46:10,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:46:10,469 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:46:10,497 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:46:10,669 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:46:10,669 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:46:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:46:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 61 times [2022-04-08 09:46:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:10,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504359929] [2022-04-08 09:46:10,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:46:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 62 times [2022-04-08 09:46:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:46:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110893295] [2022-04-08 09:46:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:46:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:46:10,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:46:10,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044501538] [2022-04-08 09:46:10,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:46:10,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:46:10,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:46:10,694 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:46:10,694 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:46:10,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:46:10,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:46:10,757 WARN L261 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-08 09:46:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:46:10,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:46:11,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-08 09:46:11,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12996#true} is VALID [2022-04-08 09:46:11,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-08 09:46:11,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-08 09:46:11,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-08 09:46:11,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12996#true} is VALID [2022-04-08 09:46:11,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-08 09:46:11,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13022#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:46:11,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {13022#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13026#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:46:11,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {13026#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13030#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 09:46:11,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {13030#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-08 09:46:11,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13038#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 09:46:11,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {13038#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:46:11,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 09:46:11,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) (- 22))))} is VALID [2022-04-08 09:46:11,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13054#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:46:11,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {13054#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13058#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:46:11,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {13058#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13062#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 09:46:11,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {13062#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:46:11,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13070#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 09:46:11,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {13070#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13074#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:46:11,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {13074#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} is VALID [2022-04-08 09:46:11,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:46:11,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 14 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:46:11,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13090#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 09:46:11,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {13090#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13094#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 09:46:11,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {13094#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-08 09:46:11,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) main_~main__i~0) 20))} is VALID [2022-04-08 09:46:11,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13106#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 09:46:11,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {13106#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13110#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-08 09:46:11,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {13110#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13114#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-08 09:46:11,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {13114#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13118#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 09:46:11,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {13118#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 09:46:12,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) main_~main__sum~0 (* (- 1) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} is VALID [2022-04-08 09:46:12,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~0)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:46:12,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~0)) (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 5 main_~main__i~0))))} is VALID [2022-04-08 09:46:12,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 5 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13138#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-08 09:46:12,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {13138#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ main_~main__sum~0 (- 435))))} is VALID [2022-04-08 09:46:12,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ main_~main__sum~0 (- 435))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} is VALID [2022-04-08 09:46:12,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:46:12,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} is VALID [2022-04-08 09:46:12,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13158#(and (= (+ (* 5 main_~main__i~0) 420) main_~main__sum~0) (= 30 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 09:46:12,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {13158#(and (= (+ (* 5 main_~main__i~0) 420) main_~main__sum~0) (= 30 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:46:12,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 main_~main__n~0))} is VALID [2022-04-08 09:46:12,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:46:12,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-08 09:46:12,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-08 09:46:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:46:12,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:46:42,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-08 09:46:42,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-08 09:46:42,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {13183#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:46:42,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13183#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:46:42,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:42,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:46:43,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-08 09:46:43,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {12996#true} is VALID [2022-04-08 09:46:43,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-08 09:46:43,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-08 09:46:43,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-08 09:46:43,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {12996#true} is VALID [2022-04-08 09:46:43,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-08 09:46:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-08 09:46:43,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:46:43,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110893295] [2022-04-08 09:46:43,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:46:43,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044501538] [2022-04-08 09:46:43,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044501538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:46:43,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:46:43,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 5] total 42 [2022-04-08 09:46:43,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:46:43,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504359929] [2022-04-08 09:46:43,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504359929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:46:43,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:46:43,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 09:46:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047018863] [2022-04-08 09:46:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:46:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 09:46:43,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:46:43,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:46:43,960 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:46:43,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 09:46:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:46:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 09:46:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 09:46:43,961 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:07,691 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 09:47:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 09:47:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-08 09:47:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:47:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-08 09:47:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-08 09:47:07,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2022-04-08 09:47:07,977 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:47:07,978 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:47:07,978 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 09:47:07,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:47:07,979 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:47:07,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2022-04-08 09:47:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 09:47:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 09:47:08,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:47:08,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:08,026 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:08,026 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:08,027 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 09:47:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:47:08,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:08,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:08,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 09:47:08,027 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 09:47:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:47:08,028 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 09:47:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:47:08,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:47:08,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:47:08,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:47:08,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:47:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-08 09:47:08,029 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-08 09:47:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:47:08,029 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-08 09:47:08,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:47:08,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-08 09:47:08,385 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:47:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 09:47:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 09:47:08,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:47:08,385 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:47:08,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 09:47:08,593 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:47:08,594 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:47:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:47:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 63 times [2022-04-08 09:47:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:47:08,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987132886] [2022-04-08 09:47:08,594 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:47:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 64 times [2022-04-08 09:47:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:47:08,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117583411] [2022-04-08 09:47:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:47:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:47:08,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:47:08,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007690087] [2022-04-08 09:47:08,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:47:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:47:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:47:08,611 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:47:08,612 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:47:08,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:47:08,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:47:08,695 WARN L261 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-08 09:47:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:47:08,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:47:09,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13621#true} is VALID [2022-04-08 09:47:09,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-08 09:47:09,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:47:09,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {13647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13651#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:47:09,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {13651#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13655#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:47:09,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {13655#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13659#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:47:09,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {13659#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13663#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 09:47:09,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {13663#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13667#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} is VALID [2022-04-08 09:47:09,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {13667#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 4) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13671#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-08 09:47:09,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {13671#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 09:47:09,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13679#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:47:09,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {13679#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-08 09:47:09,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13687#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} is VALID [2022-04-08 09:47:10,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {13687#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13691#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:47:10,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {13691#(and (= 9 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 31) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13695#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 09:47:10,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {13695#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13699#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-08 09:47:10,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {13699#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13703#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-08 09:47:10,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {13703#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13707#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:47:10,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {13707#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:47:10,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13715#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:47:10,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {13715#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:47:10,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} is VALID [2022-04-08 09:47:10,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13727#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 09:47:10,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {13727#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13731#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-08 09:47:10,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {13731#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13735#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-08 09:47:10,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {13735#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13739#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-08 09:47:10,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {13739#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13743#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 09:47:10,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {13743#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13747#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 09:47:10,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {13747#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13751#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} is VALID [2022-04-08 09:47:10,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {13751#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 28 main_~main__i~0))} is VALID [2022-04-08 09:47:10,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 28 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13759#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 09:47:10,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-08 09:47:10,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} is VALID [2022-04-08 09:47:10,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-08 09:47:10,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:47:10,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0))} is VALID [2022-04-08 09:47:10,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-08 09:47:10,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13787#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-08 09:47:10,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {13787#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} is VALID [2022-04-08 09:47:10,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= main_~main__i~0 38))} is VALID [2022-04-08 09:47:10,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= main_~main__i~0 38))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:47:10,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-08 09:47:10,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-08 09:47:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:47:10,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:48:03,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-08 09:48:03,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-08 09:48:03,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {13812#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:48:03,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13812#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:48:03,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:03,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:48:04,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-08 09:48:04,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {13621#true} is VALID [2022-04-08 09:48:04,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-08 09:48:04,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-08 09:48:04,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-08 09:48:04,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {13621#true} is VALID [2022-04-08 09:48:04,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-08 09:48:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-08 09:48:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:48:04,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117583411] [2022-04-08 09:48:04,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:48:04,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007690087] [2022-04-08 09:48:04,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007690087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:48:04,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:48:04,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 43 [2022-04-08 09:48:04,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:48:04,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987132886] [2022-04-08 09:48:04,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987132886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:48:04,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:48:04,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 09:48:04,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247581596] [2022-04-08 09:48:04,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:48:04,841 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 09:48:04,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:48:04,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:05,063 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:48:05,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 09:48:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 09:48:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:48:05,065 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:31,346 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 09:48:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 09:48:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-08 09:48:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:48:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-08 09:48:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-08 09:48:31,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2022-04-08 09:48:31,584 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:48:31,585 INFO L225 Difference]: With dead ends: 53 [2022-04-08 09:48:31,585 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 09:48:31,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 37 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 09:48:31,586 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:48:31,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-04-08 09:48:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 09:48:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 09:48:31,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:48:31,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,636 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,636 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:31,637 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 09:48:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 09:48:31,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:31,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:31,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-08 09:48:31,637 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-08 09:48:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:48:31,638 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 09:48:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 09:48:31,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:48:31,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:48:31,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:48:31,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:48:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-08 09:48:31,639 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-08 09:48:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:48:31,639 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-08 09:48:31,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:48:31,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-08 09:48:31,964 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:48:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 09:48:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 09:48:31,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:48:31,964 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:48:31,995 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:48:32,181 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:48:32,182 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:48:32,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:48:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 65 times [2022-04-08 09:48:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:48:32,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780650074] [2022-04-08 09:48:32,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:48:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 66 times [2022-04-08 09:48:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:48:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891858796] [2022-04-08 09:48:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:48:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:48:32,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:48:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502803990] [2022-04-08 09:48:32,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:48:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:48:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:48:32,202 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:48:32,203 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:48:32,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-08 09:48:32,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:48:32,295 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-08 09:48:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:48:32,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:48:33,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-08 09:48:33,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14259#true} is VALID [2022-04-08 09:48:33,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-08 09:48:33,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-08 09:48:33,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-08 09:48:33,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14259#true} is VALID [2022-04-08 09:48:33,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-08 09:48:33,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14285#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:48:33,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14289#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:48:33,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {14289#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14293#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:48:33,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {14293#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14297#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:48:33,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {14297#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14301#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:48:33,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {14301#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14305#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 09:48:33,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {14305#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14309#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 09:48:33,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {14309#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14313#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:48:33,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {14313#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14317#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:48:33,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {14317#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 25))))} is VALID [2022-04-08 09:48:33,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 25))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14325#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:48:33,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {14325#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14329#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:48:33,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {14329#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14333#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-08 09:48:33,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {14333#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14337#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-08 09:48:33,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {14337#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14341#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:48:33,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {14341#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14345#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:48:33,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {14345#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:48:33,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14353#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 09:48:33,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14357#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} is VALID [2022-04-08 09:48:33,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {14357#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14361#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:48:33,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {14361#(and (= (+ (- 3) main_~main__i~0) 17) (= (+ 131 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14365#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-08 09:48:33,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {14365#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14369#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 09:48:33,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {14369#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-08 09:48:33,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:48:33,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} is VALID [2022-04-08 09:48:33,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14385#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-08 09:48:33,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {14385#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14389#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} is VALID [2022-04-08 09:48:33,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {14389#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14393#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 09:48:33,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {14393#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 09:48:33,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14401#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-08 09:48:33,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {14401#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:48:33,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 28))} is VALID [2022-04-08 09:48:33,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14413#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-08 09:48:33,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {14413#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14417#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} is VALID [2022-04-08 09:48:33,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {14417#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:48:33,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14425#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} is VALID [2022-04-08 09:48:33,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-08 09:48:33,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} is VALID [2022-04-08 09:48:33,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} is VALID [2022-04-08 09:48:33,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:48:33,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-08 09:48:33,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-08 09:48:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:48:33,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:49:34,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-08 09:49:34,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-08 09:49:34,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {14454#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:49:34,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14454#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:49:34,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:34,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:49:35,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-08 09:49:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-08 09:49:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:49:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891858796] [2022-04-08 09:49:35,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:49:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502803990] [2022-04-08 09:49:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502803990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:49:35,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:49:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 5] total 44 [2022-04-08 09:49:35,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:49:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780650074] [2022-04-08 09:49:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780650074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:49:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:49:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 09:49:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774393934] [2022-04-08 09:49:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:49:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 09:49:35,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:49:35,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:49:36,099 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:49:36,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 09:49:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:49:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 09:49:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 09:49:36,100 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:06,355 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 09:50:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 09:50:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 09:50:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:50:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-08 09:50:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-08 09:50:06,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2022-04-08 09:50:06,734 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:50:06,735 INFO L225 Difference]: With dead ends: 54 [2022-04-08 09:50:06,735 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 09:50:06,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 09:50:06,735 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:50:06,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 330 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-08 09:50:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 09:50:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 09:50:06,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:50:06,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,787 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,787 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:06,787 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:50:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:50:06,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:50:06,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:50:06,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 09:50:06,788 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-08 09:50:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:50:06,788 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:50:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:50:06,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:50:06,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:50:06,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:50:06,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:50:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-08 09:50:06,789 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-08 09:50:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:50:06,790 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-08 09:50:06,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:50:06,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-08 09:50:07,185 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:50:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 09:50:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 09:50:07,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:50:07,186 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:50:07,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 09:50:07,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:50:07,386 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:50:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:50:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 67 times [2022-04-08 09:50:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:50:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065669918] [2022-04-08 09:50:07,387 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:50:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 68 times [2022-04-08 09:50:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:50:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361377850] [2022-04-08 09:50:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:50:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:50:07,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:50:07,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589031930] [2022-04-08 09:50:07,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:50:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:50:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:50:07,405 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:50:07,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 09:50:07,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:50:07,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:50:07,474 WARN L261 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 164 conjunts are in the unsatisfiable core [2022-04-08 09:50:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:50:07,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:50:08,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14910#true} is VALID [2022-04-08 09:50:08,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-08 09:50:08,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14936#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:50:08,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {14936#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14940#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 09:50:08,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {14940#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14944#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:50:08,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {14944#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14948#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:50:08,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {14948#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 09:50:08,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {14952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:50:08,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14960#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 09:50:08,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {14960#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14964#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:50:08,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {14964#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14968#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:50:08,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {14968#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14972#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 09:50:08,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {14972#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14976#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 09:50:08,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {14976#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14980#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 09:50:08,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {14980#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14984#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 09:50:08,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {14984#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14988#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:50:08,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {14988#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14992#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:50:09,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {14992#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14996#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-08 09:50:09,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {14996#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15000#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:50:09,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {15000#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15008#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 09:50:09,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {15008#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-08 09:50:09,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15016#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-08 09:50:09,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {15016#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15020#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 09:50:09,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {15020#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-08 09:50:09,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) main_~main__sum~0 (* (- 3) main_~main__i~0))))} is VALID [2022-04-08 09:50:09,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) main_~main__sum~0 (* (- 3) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} is VALID [2022-04-08 09:50:09,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 5) main_~main__i~0))))} is VALID [2022-04-08 09:50:09,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 5) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 6) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 6) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 22 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-08 09:50:09,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 22 (+ main_~main__i~0 (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15056#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 09:50:09,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {15056#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} is VALID [2022-04-08 09:50:09,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 09:50:09,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 3) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-08 09:50:09,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} is VALID [2022-04-08 09:50:09,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-08 09:50:09,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} is VALID [2022-04-08 09:50:09,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 39 main_~main__i~0))} is VALID [2022-04-08 09:50:09,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 main_~main__n~0))} is VALID [2022-04-08 09:50:09,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:50:09,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-08 09:50:09,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-08 09:50:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:50:09,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:51:23,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-08 09:51:23,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-08 09:51:23,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {15109#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:51:23,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15109#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:51:24,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:24,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:51:25,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {14910#true} is VALID [2022-04-08 09:51:25,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-08 09:51:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-04-08 09:51:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:51:25,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361377850] [2022-04-08 09:51:25,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:51:25,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589031930] [2022-04-08 09:51:25,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589031930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:51:25,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:51:25,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 5] total 45 [2022-04-08 09:51:25,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:51:25,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065669918] [2022-04-08 09:51:25,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065669918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:25,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:25,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 09:51:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114012580] [2022-04-08 09:51:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:51:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 09:51:25,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:51:25,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:51:25,812 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:51:25,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 09:51:25,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 09:51:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 09:51:25,813 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:09,130 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 09:52:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 09:52:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 09:52:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:52:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-08 09:52:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-08 09:52:09,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2022-04-08 09:52:09,502 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:52:09,502 INFO L225 Difference]: With dead ends: 55 [2022-04-08 09:52:09,503 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 09:52:09,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 39 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 09:52:09,503 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:52:09,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 338 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2022-04-08 09:52:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 09:52:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 09:52:09,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:52:09,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,554 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,554 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:09,555 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 09:52:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 09:52:09,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:09,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:09,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 09:52:09,555 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 09:52:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:09,556 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 09:52:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 09:52:09,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:09,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:09,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:52:09,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:52:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-08 09:52:09,556 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-08 09:52:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:52:09,557 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-08 09:52:09,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:52:09,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-08 09:52:10,112 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:52:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 09:52:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 09:52:10,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:52:10,113 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:52:10,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 09:52:10,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 09:52:10,313 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:52:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:52:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1128544342, now seen corresponding path program 69 times [2022-04-08 09:52:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:52:10,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468697932] [2022-04-08 09:52:10,314 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:52:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1128544342, now seen corresponding path program 70 times [2022-04-08 09:52:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:52:10,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738638871] [2022-04-08 09:52:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:52:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:52:10,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:52:10,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191666986] [2022-04-08 09:52:10,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:52:10,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:52:10,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:52:10,333 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:52:10,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 09:52:10,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:52:10,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:52:10,419 WARN L261 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 168 conjunts are in the unsatisfiable core [2022-04-08 09:52:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:10,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:52:11,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {15574#true} call ULTIMATE.init(); {15574#true} is VALID [2022-04-08 09:52:11,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {15574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {15574#true} is VALID [2022-04-08 09:52:11,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {15574#true} assume true; {15574#true} is VALID [2022-04-08 09:52:11,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15574#true} {15574#true} #58#return; {15574#true} is VALID [2022-04-08 09:52:11,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {15574#true} call #t~ret5 := main(); {15574#true} is VALID [2022-04-08 09:52:11,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {15574#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15574#true} is VALID [2022-04-08 09:52:11,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {15574#true} assume !!(1 <= ~main__n~0); {15574#true} is VALID [2022-04-08 09:52:11,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {15574#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15600#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:52:11,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {15600#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15604#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:52:11,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {15604#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15608#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:52:11,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {15608#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15612#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 09:52:11,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15616#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 09:52:11,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {15616#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15620#(and (= 6 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 09:52:11,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {15620#(and (= 6 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 12))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15624#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 09:52:11,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {15624#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15628#(and (= 3 (+ main_~main__sum~0 (- 25))) (= 8 main_~main__i~0))} is VALID [2022-04-08 09:52:11,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {15628#(and (= 3 (+ main_~main__sum~0 (- 25))) (= 8 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15632#(and (= (+ main_~main__sum~0 (- 33)) 3) (= 9 main_~main__i~0))} is VALID [2022-04-08 09:52:11,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {15632#(and (= (+ main_~main__sum~0 (- 33)) 3) (= 9 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15636#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 09:52:11,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {15636#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15640#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:52:11,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {15640#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15644#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 09:52:11,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {15644#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15648#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:52:11,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {15648#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15652#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:52:11,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {15652#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15656#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 09:52:11,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15660#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} is VALID [2022-04-08 09:52:11,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {15660#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15664#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 09:52:11,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {15664#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15668#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 09:52:11,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {15668#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15672#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ 134 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:52:11,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {15672#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ 134 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15676#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 09:52:11,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {15676#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15680#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} is VALID [2022-04-08 09:52:11,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {15680#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15684#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} is VALID [2022-04-08 09:52:11,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {15684#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15688#(and (= 23 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 100))))} is VALID [2022-04-08 09:52:11,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {15688#(and (= 23 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 100))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15692#(and (= (+ (- 1) main_~main__i~0) 23) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 99))))} is VALID [2022-04-08 09:52:11,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {15692#(and (= (+ (- 1) main_~main__i~0) 23) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 99))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15696#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 97)) 153) (= 23 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:52:11,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {15696#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 97)) 153) (= 23 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15700#(and (= 23 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 247)))} is VALID [2022-04-08 09:52:11,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {15700#(and (= 23 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 247)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15704#(and (= (+ (* 3 main_~main__i~0) 244) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:52:11,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {15704#(and (= (+ (* 3 main_~main__i~0) 244) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15708#(and (= (+ (* 3 main_~main__i~0) 241) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 23 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 09:52:11,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {15708#(and (= (+ (* 3 main_~main__i~0) 241) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 23 (+ (- 5) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15712#(and (= (+ (- 6) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 3 main_~main__i~0) 238)))} is VALID [2022-04-08 09:52:11,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#(and (= (+ (- 6) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 3 main_~main__i~0) 238)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15716#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} is VALID [2022-04-08 09:52:11,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {15716#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15720#(and (= 31 main_~main__i~0) (= (+ (- 140) main_~main__sum~0) 325))} is VALID [2022-04-08 09:52:11,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {15720#(and (= 31 main_~main__i~0) (= (+ (- 140) main_~main__sum~0) 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15724#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 139))) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-08 09:52:11,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {15724#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 139))) (= (+ (- 1) main_~main__i~0) 31))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15728#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 137)) 325) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:52:11,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {15728#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 137)) 325) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15732#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} is VALID [2022-04-08 09:52:11,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {15732#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15736#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2022-04-08 09:52:11,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {15736#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15740#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-08 09:52:11,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {15740#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15744#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 629))) (= (+ (- 630) main_~main__sum~0) 36))} is VALID [2022-04-08 09:52:11,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {15744#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 629))) (= (+ (- 630) main_~main__sum~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15748#(and (= (+ (- 2) main_~main__i~0) 36) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 627)))} is VALID [2022-04-08 09:52:11,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {15748#(and (= (+ (- 2) main_~main__i~0) 36) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 627)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15752#(and (= (+ (- 38) main_~main__sum~0) 703) (= 39 main_~main__i~0))} is VALID [2022-04-08 09:52:11,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {15752#(and (= (+ (- 38) main_~main__sum~0) 703) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15756#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2022-04-08 09:52:11,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {15756#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15760#(and (= (+ main_~main__sum~0 (- 40)) 780) (<= 40 main_~main__n~0) (<= main_~main__i~0 41))} is VALID [2022-04-08 09:52:11,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {15760#(and (= (+ main_~main__sum~0 (- 40)) 780) (<= 40 main_~main__n~0) (<= main_~main__i~0 41))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:52:11,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15575#false} is VALID [2022-04-08 09:52:11,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {15575#false} assume !false; {15575#false} is VALID [2022-04-08 09:52:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:52:11,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:53:51,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {15575#false} assume !false; {15575#false} is VALID [2022-04-08 09:53:51,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15575#false} is VALID [2022-04-08 09:53:51,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {15777#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:53:51,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15777#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-08 09:53:51,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:51,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:52,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {15574#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15781#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 09:53:53,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {15574#true} assume !!(1 <= ~main__n~0); {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {15574#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {15574#true} call #t~ret5 := main(); {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15574#true} {15574#true} #58#return; {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {15574#true} assume true; {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {15574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {15574#true} call ULTIMATE.init(); {15574#true} is VALID [2022-04-08 09:53:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-04-08 09:53:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:53:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738638871] [2022-04-08 09:53:53,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:53:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191666986] [2022-04-08 09:53:53,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191666986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:53:53,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:53:53,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 5] total 46 [2022-04-08 09:53:53,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:53:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468697932] [2022-04-08 09:53:53,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468697932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:53,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:53,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 09:53:53,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788879319] [2022-04-08 09:53:53,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:53:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 09:53:53,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:53:53,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:53:53,551 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:53:53,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 09:53:53,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 09:53:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 09:53:53,552 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:39,085 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 09:54:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 09:54:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 09:54:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:54:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-08 09:54:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-08 09:54:39,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-08 09:54:39,490 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:54:39,490 INFO L225 Difference]: With dead ends: 56 [2022-04-08 09:54:39,490 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 09:54:39,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 96.5s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 09:54:39,491 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:54:39,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 346 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 24.4s Time] [2022-04-08 09:54:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 09:54:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 09:54:39,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:54:39,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,543 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:39,544 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 09:54:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:54:39,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:54:39,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:54:39,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:54:39,544 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 09:54:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:54:39,545 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 09:54:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:54:39,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:54:39,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:54:39,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:54:39,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:54:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-08 09:54:39,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-08 09:54:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:54:39,546 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-08 09:54:39,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:54:39,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-08 09:54:40,177 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:54:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 09:54:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 09:54:40,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:54:40,178 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:54:40,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-08 09:54:40,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:54:40,391 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:54:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:54:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -625198687, now seen corresponding path program 71 times [2022-04-08 09:54:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:54:40,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776813878] [2022-04-08 09:54:40,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:54:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -625198687, now seen corresponding path program 72 times [2022-04-08 09:54:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:54:40,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052661403] [2022-04-08 09:54:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:54:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:54:40,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:54:40,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410020099] [2022-04-08 09:54:40,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:54:40,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:54:40,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:54:40,410 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:54:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 09:54:40,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 09:54:40,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:54:40,481 WARN L261 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 172 conjunts are in the unsatisfiable core [2022-04-08 09:54:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:54:40,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:54:41,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {16251#true} call ULTIMATE.init(); {16251#true} is VALID [2022-04-08 09:54:41,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {16251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {16251#true} assume true; {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16251#true} {16251#true} #58#return; {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {16251#true} call #t~ret5 := main(); {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {16251#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__n~0 := #t~nondet4;havoc #t~nondet4; {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {16251#true} assume !!(1 <= ~main__n~0); {16251#true} is VALID [2022-04-08 09:54:41,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {16251#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {16277#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 09:54:41,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {16277#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16281#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 09:54:41,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {16281#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16285#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 09:54:41,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {16285#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16289#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 09:54:41,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {16289#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16293#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 09:54:41,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {16293#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16297#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-08 09:54:41,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16301#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-08 09:54:41,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {16301#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16305#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 09:54:41,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {16305#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16309#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-08 09:54:41,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {16309#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16313#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-08 09:54:41,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {16313#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16317#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:54:41,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {16317#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16321#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 21)) (= 8 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 09:54:41,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {16321#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 21)) (= 8 (+ (- 4) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16325#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-08 09:54:41,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {16325#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16329#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 09:54:41,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {16329#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16333#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:54:41,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {16333#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16337#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 09:54:41,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {16337#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16341#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 09:54:41,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {16341#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16345#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 09:54:41,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {16345#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16349#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 09:54:41,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {16349#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16353#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 09:54:41,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {16353#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16357#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-08 09:54:41,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {16357#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16361#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 09:54:41,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {16361#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16365#(and (= (+ (- 3) main_~main__i~0) 20) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 184)))} is VALID [2022-04-08 09:54:41,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {16365#(and (= (+ (- 3) main_~main__i~0) 20) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 184)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16369#(and (= (+ (* 3 main_~main__i~0) 181) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 20))} is VALID [2022-04-08 09:54:41,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {16369#(and (= (+ (* 3 main_~main__i~0) 181) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16373#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) 178)) (= (+ (- 5) main_~main__i~0) 20))} is VALID [2022-04-08 09:54:41,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {16373#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 3 main_~main__i~0) 178)) (= (+ (- 5) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16377#(and (= (+ (* 3 main_~main__i~0) 175) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 6) main_~main__i~0) 20))} is VALID [2022-04-08 09:54:41,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {16377#(and (= (+ (* 3 main_~main__i~0) 175) (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6)) (= (+ (- 6) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16381#(and (= 20 (+ (- 7) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) 172) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} is VALID [2022-04-08 09:54:41,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {16381#(and (= 20 (+ (- 7) main_~main__i~0)) (= (+ (* 3 main_~main__i~0) 172) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16385#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) (+ 169 (* 3 main_~main__i~0))) (= 20 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-08 09:54:41,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {16385#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) (+ 169 (* 3 main_~main__i~0))) (= 20 (+ main_~main__i~0 (- 8))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16389#(and (= main_~main__sum~0 (+ 145 (* 9 main_~main__i~0))) (= (+ (- 9) main_~main__i~0) 20))} is VALID [2022-04-08 09:54:41,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {16389#(and (= main_~main__sum~0 (+ 145 (* 9 main_~main__i~0))) (= (+ (- 9) main_~main__i~0) 20))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16393#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-08 09:54:41,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {16393#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16397#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} is VALID [2022-04-08 09:54:41,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {16397#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16401#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-08 09:54:41,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {16401#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16405#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-08 09:54:41,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {16405#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16409#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2022-04-08 09:54:41,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {16409#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16413#(and (= 561 (+ main_~main__sum~0 (- 34))) (= 35 main_~main__i~0))} is VALID [2022-04-08 09:54:41,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {16413#(and (= 561 (+ main_~main__sum~0 (- 34))) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16417#(and (= (+ (- 1) main_~main__i~0) 35) (= (+ 594 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 09:54:41,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {16417#(and (= (+ (- 1) main_~main__i~0) 35) (= (+ 594 main_~main__i~0) main_~main__sum~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 592)) (= 35 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 09:54:41,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {16421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 592)) (= 35 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16425#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2022-04-08 09:54:41,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {16425#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16429#(and (= (+ (- 1) main_~main__i~0) 38) (= 703 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 09:54:41,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {16429#(and (= (+ (- 1) main_~main__i~0) 38) (= 703 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16433#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 700)) (= (+ (- 2) main_~main__i~0) 38))} is VALID [2022-04-08 09:54:41,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {16433#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 700)) (= (+ (- 2) main_~main__i~0) 38))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16437#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2022-04-08 09:54:41,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {16437#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16441#(and (= (+ main_~main__sum~0 (- 41)) 820) (<= main_~main__i~0 42) (<= 41 main_~main__n~0))} is VALID [2022-04-08 09:54:41,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {16441#(and (= (+ main_~main__sum~0 (- 41)) 820) (<= main_~main__i~0 42) (<= 41 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16445#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 09:54:41,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {16445#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {16252#false} is VALID [2022-04-08 09:54:41,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {16252#false} assume !false; {16252#false} is VALID [2022-04-08 09:54:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:54:41,849 INFO L328 TraceCheckSpWp]: Computing backward predicates...