java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:42:22,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:42:22,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:42:22,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:42:22,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:42:22,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:42:22,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:42:22,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:42:22,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:42:22,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:42:22,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:42:22,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:42:22,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:42:22,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:42:22,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:42:22,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:42:22,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:42:22,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:42:22,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:42:22,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:42:22,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:42:22,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:42:22,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:42:22,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:42:22,650 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:42:22,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:42:22,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:42:22,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:42:22,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:42:22,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:42:22,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:42:22,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:42:22,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:42:22,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:42:22,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:42:22,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:42:22,667 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:42:22,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:42:22,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:42:22,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:42:22,698 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:42:22,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:42:22,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:42:22,699 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:42:22,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:42:22,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:42:22,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:42:22,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:42:22,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:42:22,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:42:22,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:42:22,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:42:22,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:42:22,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:42:22,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:42:22,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:42:22,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:42:22,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:42:22,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:42:22,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:42:22,708 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:42:22,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:42:22,708 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:42:22,708 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:42:22,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:42:22,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:42:22,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:42:22,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:42:22,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:42:22,803 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:42:22,804 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call_true-termination.i [2018-11-23 11:42:22,877 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2553f7025/0a2074548c6e4ac692b2cb670c17bb02/FLAGbdf955c27 [2018-11-23 11:42:23,343 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:42:23,343 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call_true-termination.i [2018-11-23 11:42:23,350 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2553f7025/0a2074548c6e4ac692b2cb670c17bb02/FLAGbdf955c27 [2018-11-23 11:42:23,722 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2553f7025/0a2074548c6e4ac692b2cb670c17bb02 [2018-11-23 11:42:23,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:42:23,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:42:23,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:42:23,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:42:23,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:42:23,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:23" (1/1) ... [2018-11-23 11:42:23,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507f8ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:23, skipping insertion in model container [2018-11-23 11:42:23,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:23" (1/1) ... [2018-11-23 11:42:23,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:42:23,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:42:23,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:42:23,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:42:24,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:42:24,021 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:42:24,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24 WrapperNode [2018-11-23 11:42:24,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:42:24,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:42:24,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:42:24,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:42:24,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:42:24,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:42:24,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:42:24,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:42:24,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... [2018-11-23 11:42:24,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:42:24,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:42:24,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:42:24,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:42:24,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:42:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:42:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:42:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:42:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:42:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:42:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:42:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:42:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:42:24,648 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:42:24,648 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:42:24,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:24 BoogieIcfgContainer [2018-11-23 11:42:24,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:42:24,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:42:24,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:42:24,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:42:24,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:42:23" (1/3) ... [2018-11-23 11:42:24,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b3c97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:24, skipping insertion in model container [2018-11-23 11:42:24,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:24" (2/3) ... [2018-11-23 11:42:24,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b3c97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:24, skipping insertion in model container [2018-11-23 11:42:24,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:24" (3/3) ... [2018-11-23 11:42:24,657 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call_true-termination.i [2018-11-23 11:42:24,669 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:42:24,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:42:24,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:42:24,725 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:42:24,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:42:24,726 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:42:24,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:42:24,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:42:24,726 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:42:24,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:42:24,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:42:24,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:42:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:42:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:42:24,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:24,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:24,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:24,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911547, now seen corresponding path program 1 times [2018-11-23 11:42:24,767 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:24,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:24,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:24,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:42:24,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:42:24,905 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-23 11:42:24,905 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 11:42:24,905 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-23 11:42:24,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {23#true} is VALID [2018-11-23 11:42:24,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 11:42:24,909 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:42:24,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:42:24,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:42:24,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:42:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:24,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:42:24,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:42:24,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:42:24,923 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:42:24,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:24,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:42:24,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:42:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:42:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:42:24,993 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 11:42:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:25,117 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:42:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:42:25,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:42:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:42:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:42:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:42:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:42:25,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 11:42:25,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:25,512 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:42:25,512 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:42:25,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:42:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:42:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:42:25,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:25,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:25,580 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:25,580 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:25,583 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:42:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:25,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:25,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:25,584 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:25,584 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:25,587 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:42:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:25,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:25,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:25,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:25,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:42:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:42:25,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 11:42:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:25,593 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:42:25,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:42:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:42:25,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:25,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:25,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:25,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1287452673, now seen corresponding path program 1 times [2018-11-23 11:42:25,595 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:25,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:25,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2018-11-23 11:42:25,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2018-11-23 11:42:25,792 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #37#return; {144#true} is VALID [2018-11-23 11:42:25,792 INFO L256 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2018-11-23 11:42:25,793 INFO L273 TraceCheckUtils]: 4: Hoare triple {144#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2018-11-23 11:42:25,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {144#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {164#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:25,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {164#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~n~0); {145#false} is VALID [2018-11-23 11:42:25,795 INFO L256 TraceCheckUtils]: 7: Hoare triple {145#false} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {145#false} is VALID [2018-11-23 11:42:25,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {145#false} ~cond := #in~cond; {145#false} is VALID [2018-11-23 11:42:25,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {145#false} assume 0bv32 == ~cond; {145#false} is VALID [2018-11-23 11:42:25,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#false} assume !false; {145#false} is VALID [2018-11-23 11:42:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:25,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:42:25,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:42:25,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:42:25,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 11:42:25,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:25,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:42:25,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:25,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:42:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:42:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:42:25,848 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-23 11:42:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:26,051 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:42:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:42:26,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 11:42:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:42:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 11:42:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:42:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 11:42:26,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2018-11-23 11:42:26,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:26,109 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:42:26,109 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:42:26,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:42:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:42:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 11:42:26,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:26,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:26,130 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:26,132 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:42:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:42:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:26,133 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-11-23 11:42:26,133 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-11-23 11:42:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:26,135 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:42:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:42:26,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:26,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:26,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:26,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:42:26,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 11:42:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:26,138 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:42:26,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:42:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:42:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:42:26,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:26,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:26,139 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:26,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 843923389, now seen corresponding path program 1 times [2018-11-23 11:42:26,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:26,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:26,787 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:42:27,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 11:42:27,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 11:42:27,158 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #37#return; {261#true} is VALID [2018-11-23 11:42:27,158 INFO L256 TraceCheckUtils]: 3: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-23 11:42:27,159 INFO L273 TraceCheckUtils]: 4: Hoare triple {261#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {261#true} is VALID [2018-11-23 11:42:27,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {261#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {281#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:27,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {285#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:27,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {285#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {289#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:42:27,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {289#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {293#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:27,174 INFO L256 TraceCheckUtils]: 9: Hoare triple {293#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {297#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:27,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {297#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {301#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:27,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {301#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {262#false} is VALID [2018-11-23 11:42:27,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 11:42:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:27,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:28,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 11:42:28,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {262#false} is VALID [2018-11-23 11:42:28,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {315#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {311#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:42:28,396 INFO L256 TraceCheckUtils]: 9: Hoare triple {319#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {315#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:42:28,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {323#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} assume !~bvsle32(~i~0, ~n~0); {319#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} is VALID [2018-11-23 11:42:28,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {327#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {323#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:42:28,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {331#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {327#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:42:28,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {261#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {331#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:42:28,579 INFO L273 TraceCheckUtils]: 4: Hoare triple {261#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {261#true} is VALID [2018-11-23 11:42:28,580 INFO L256 TraceCheckUtils]: 3: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-23 11:42:28,580 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #37#return; {261#true} is VALID [2018-11-23 11:42:28,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 11:42:28,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 11:42:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:42:28,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 11:42:28,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:28,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:42:28,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:28,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:42:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:42:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:42:28,812 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-11-23 11:42:29,750 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:42:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:30,762 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:42:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:42:30,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 11:42:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 11:42:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 11:42:30,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2018-11-23 11:42:30,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:30,862 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:42:30,862 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:42:30,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:42:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:42:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:42:30,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:30,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:42:30,876 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:42:30,876 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:42:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:30,878 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:42:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:42:30,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:30,880 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:42:30,880 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:42:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:30,882 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:42:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:42:30,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:30,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:30,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:30,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:42:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 11:42:30,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-23 11:42:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 11:42:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:42:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:42:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:42:30,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:30,887 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:30,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:30,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 322218169, now seen corresponding path program 2 times [2018-11-23 11:42:30,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:30,888 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:30,909 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:42:30,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:42:30,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:42:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:31,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:31,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 11:42:31,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 11:42:31,603 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {459#true} {459#true} #37#return; {459#true} is VALID [2018-11-23 11:42:31,603 INFO L256 TraceCheckUtils]: 3: Hoare triple {459#true} call #t~ret3 := main(); {459#true} is VALID [2018-11-23 11:42:31,604 INFO L273 TraceCheckUtils]: 4: Hoare triple {459#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {459#true} is VALID [2018-11-23 11:42:31,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {479#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:31,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {479#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {483#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:31,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {487#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:42:31,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {487#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {491#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:42:31,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {491#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {495#(and (bvsle (_ bv2 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:42:31,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {495#(and (bvsle (_ bv2 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {499#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~sum~0 (_ bv4294967293 32)) main_~i~0))} is VALID [2018-11-23 11:42:31,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~sum~0 (_ bv4294967293 32)) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {503#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0) (= (bvadd main_~sum~0 (_ bv4294967294 32)) main_~i~0))} is VALID [2018-11-23 11:42:31,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0) (= (bvadd main_~sum~0 (_ bv4294967294 32)) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {507#(and (bvsle (_ bv3 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvsle (_ bv4 32) main_~n~0)))} is VALID [2018-11-23 11:42:31,637 INFO L256 TraceCheckUtils]: 13: Hoare triple {507#(and (bvsle (_ bv3 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvsle (_ bv4 32) main_~n~0)))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {511#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:31,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {511#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {515#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:31,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {460#false} is VALID [2018-11-23 11:42:31,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 11:42:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:31,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:36,292 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:42:36,856 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:42:37,413 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:42:37,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 11:42:37,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {525#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {460#false} is VALID [2018-11-23 11:42:37,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {529#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {525#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:42:37,467 INFO L256 TraceCheckUtils]: 13: Hoare triple {533#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {529#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:42:37,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {537#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} assume !~bvsle32(~i~0, ~n~0); {533#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} is VALID [2018-11-23 11:42:37,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {537#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:42:37,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {545#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {541#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:42:39,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {549#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0) (_ bv2 32))) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {545#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)))} is UNKNOWN [2018-11-23 11:42:41,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {553#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv2 32))))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {549#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0) (_ bv2 32))) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:42:43,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {557#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {553#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv2 32))))} is UNKNOWN [2018-11-23 11:42:45,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {561#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {557#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:42:45,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {561#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is VALID [2018-11-23 11:42:45,591 INFO L273 TraceCheckUtils]: 4: Hoare triple {459#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {459#true} is VALID [2018-11-23 11:42:45,591 INFO L256 TraceCheckUtils]: 3: Hoare triple {459#true} call #t~ret3 := main(); {459#true} is VALID [2018-11-23 11:42:45,591 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {459#true} {459#true} #37#return; {459#true} is VALID [2018-11-23 11:42:45,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 11:42:45,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 11:42:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:45,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:45,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:42:45,601 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-11-23 11:42:45,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:45,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:42:53,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 24 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:53,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:42:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:42:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:42:53,892 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 22 states. [2018-11-23 11:42:56,310 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:42:56,712 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 14 [2018-11-23 11:42:57,299 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:42:58,149 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:42:59,832 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-11-23 11:43:00,683 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:43:01,163 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:43:02,587 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:43:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:02,932 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 11:43:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:43:02,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-11-23 11:43:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:43:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2018-11-23 11:43:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:43:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2018-11-23 11:43:02,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 35 transitions. [2018-11-23 11:43:09,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 32 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:09,318 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:43:09,318 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:43:09,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:43:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:43:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:43:09,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:09,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:43:09,354 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:43:09,355 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:43:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:09,357 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:43:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:43:09,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:09,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:09,358 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:43:09,358 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:43:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:09,360 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:43:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:43:09,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:09,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:09,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:09,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:43:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 11:43:09,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2018-11-23 11:43:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:09,364 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 11:43:09,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:43:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:43:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:43:09,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:09,365 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:09,367 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:09,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1167859535, now seen corresponding path program 3 times [2018-11-23 11:43:09,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:09,368 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:43:09,385 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:43:09,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:43:09,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:43:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:09,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:11,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-23 11:43:11,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 11:43:11,261 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {741#true} {741#true} #37#return; {741#true} is VALID [2018-11-23 11:43:11,261 INFO L256 TraceCheckUtils]: 3: Hoare triple {741#true} call #t~ret3 := main(); {741#true} is VALID [2018-11-23 11:43:11,261 INFO L273 TraceCheckUtils]: 4: Hoare triple {741#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {741#true} is VALID [2018-11-23 11:43:11,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {761#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {761#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {765#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {765#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {769#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {773#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:43:11,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {773#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {777#(and (= (bvadd main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:43:11,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {777#(and (= (bvadd main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {781#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv3 32) (bvadd (bvneg main_~i~0) main_~sum~0)))} is VALID [2018-11-23 11:43:11,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {781#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv3 32) (bvadd (bvneg main_~i~0) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {785#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv3 32) (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:43:11,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {785#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv3 32) (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {789#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvneg main_~i~0) (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {789#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvneg main_~i~0) (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {793#(and (= (_ bv10 32) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {793#(and (= (_ bv10 32) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {797#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967286 32)) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {797#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967286 32)) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {801#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv9 32)) main_~sum~0))} is VALID [2018-11-23 11:43:11,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {801#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv9 32)) main_~sum~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {805#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv9 32)) main_~sum~0))} is VALID [2018-11-23 11:43:11,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv9 32)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {809#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967289 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {809#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967289 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {813#(and (= (bvadd main_~sum~0 (_ bv4294967289 32)) (bvmul (_ bv3 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {813#(and (= (bvadd main_~sum~0 (_ bv4294967289 32)) (bvmul (_ bv3 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {817#(and (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv4 32)) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv8 32) main_~i~0))} is VALID [2018-11-23 11:43:11,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {817#(and (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv4 32)) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv8 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {821#(and (not (bvsle (_ bv8 32) main_~n~0)) (bvsle (_ bv7 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967268 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:11,343 INFO L256 TraceCheckUtils]: 21: Hoare triple {821#(and (not (bvsle (_ bv8 32) main_~n~0)) (bvsle (_ bv7 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967268 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {825#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:11,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {829#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:11,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {829#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {742#false} is VALID [2018-11-23 11:43:11,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-23 11:43:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:11,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:15,509 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:43:16,799 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:43:18,822 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:43:22,931 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:43:25,031 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:43:25,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-23 11:43:25,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {839#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {742#false} is VALID [2018-11-23 11:43:25,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {839#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:43:25,117 INFO L256 TraceCheckUtils]: 21: Hoare triple {847#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {843#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:43:25,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {851#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} assume !~bvsle32(~i~0, ~n~0); {847#(= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0))} is VALID [2018-11-23 11:43:25,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {855#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {851#(or (bvsle main_~i~0 main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:43:25,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {859#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {855#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~sum~0)))} is VALID [2018-11-23 11:43:27,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0) (_ bv2 32))) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {859#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0))) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)))} is UNKNOWN [2018-11-23 11:43:29,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv2 32))))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {863#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv2 32) main_~i~0) (_ bv2 32))) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:43:31,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {871#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {867#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv2 32))))} is UNKNOWN [2018-11-23 11:43:33,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {875#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {871#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv4 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:43:35,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {879#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv12 32))) (not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {875#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv6 32))) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:43:37,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {883#(or (not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv8 32) main_~i~0) (_ bv12 32))) (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {879#(or (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv6 32) main_~i~0) (_ bv12 32))) (not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is UNKNOWN [2018-11-23 11:43:39,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {887#(or (not (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv8 32) main_~i~0) (_ bv20 32))) (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {883#(or (not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv8 32) main_~i~0) (_ bv12 32))) (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:43:41,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {891#(or (not (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv10 32) main_~i~0) (_ bv20 32)) (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32)))) (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {887#(or (not (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv8 32) main_~i~0) (_ bv20 32))) (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0))} is UNKNOWN [2018-11-23 11:43:43,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {895#(or (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv10 32) main_~i~0) (_ bv30 32)) (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32)))) (not (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {891#(or (not (bvsle (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv10 32) main_~i~0) (_ bv20 32)) (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32)))) (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0))} is UNKNOWN [2018-11-23 11:43:45,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {899#(or (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv12 32) main_~i~0) (_ bv30 32))) (not (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {895#(or (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv10 32) main_~i~0) (_ bv30 32)) (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32)))) (not (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:43:47,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {903#(or (bvsle (bvadd main_~i~0 (_ bv7 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv12 32) main_~i~0) (_ bv42 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {899#(or (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv12 32) main_~i~0) (_ bv30 32))) (not (bvsle (bvadd main_~i~0 (_ bv5 32)) main_~n~0)))} is UNKNOWN [2018-11-23 11:43:49,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {907#(or (bvsle (bvadd main_~i~0 (_ bv7 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv14 32) main_~i~0) (_ bv42 32))))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {903#(or (bvsle (bvadd main_~i~0 (_ bv7 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv12 32) main_~i~0) (_ bv42 32))))} is UNKNOWN [2018-11-23 11:43:49,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {907#(or (bvsle (bvadd main_~i~0 (_ bv7 32)) main_~n~0) (not (bvsle (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (= (bvmul main_~n~0 (bvadd main_~n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~sum~0) (bvmul (_ bv14 32) main_~i~0) (_ bv42 32))))} is VALID [2018-11-23 11:43:49,173 INFO L273 TraceCheckUtils]: 4: Hoare triple {741#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {741#true} is VALID [2018-11-23 11:43:49,173 INFO L256 TraceCheckUtils]: 3: Hoare triple {741#true} call #t~ret3 := main(); {741#true} is VALID [2018-11-23 11:43:49,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {741#true} {741#true} #37#return; {741#true} is VALID [2018-11-23 11:43:49,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 11:43:49,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-23 11:43:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:49,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:43:49,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-11-23 11:43:49,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2018-11-23 11:43:49,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:49,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:44:12,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 34 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2018-11-23 11:44:12,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:44:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:44:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:44:12,452 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 38 states. [2018-11-23 11:44:15,546 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-11-23 11:44:16,882 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-11-23 11:44:18,226 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-11-23 11:44:19,602 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-11-23 11:44:20,996 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-11-23 11:44:24,080 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:44:24,835 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 15 [2018-11-23 11:44:26,608 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:44:28,958 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:44:31,189 WARN L180 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-11-23 11:44:33,614 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:44:35,193 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:44:37,249 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-23 11:44:38,544 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:44:40,034 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:44:41,582 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 11:44:42,938 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:44:44,182 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:44:45,613 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-23 11:44:46,632 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:44:47,745 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:44:48,907 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-11-23 11:44:50,646 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:44:51,619 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:44:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:44:52,687 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:44:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:44:52,687 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2018-11-23 11:44:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:44:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:44:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2018-11-23 11:44:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:44:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2018-11-23 11:44:52,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 60 transitions. [2018-11-23 11:45:15,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 49 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:15,379 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:45:15,380 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:45:15,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=672, Invalid=4020, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 11:45:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:45:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:45:15,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:15,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:45:15,571 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:45:15,571 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:45:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:15,574 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 11:45:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 11:45:15,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:15,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:15,575 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:45:15,576 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:45:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:15,578 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 11:45:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 11:45:15,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:15,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:15,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:15,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:45:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 11:45:15,582 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2018-11-23 11:45:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:15,583 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 11:45:15,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:45:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 11:45:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:45:15,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:15,584 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:15,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:15,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash 623372449, now seen corresponding path program 4 times [2018-11-23 11:45:15,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:15,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:45:15,605 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:45:15,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:45:15,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:45:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:15,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:20,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2018-11-23 11:45:20,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {1221#true} assume true; {1221#true} is VALID [2018-11-23 11:45:20,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1221#true} {1221#true} #37#return; {1221#true} is VALID [2018-11-23 11:45:20,734 INFO L256 TraceCheckUtils]: 3: Hoare triple {1221#true} call #t~ret3 := main(); {1221#true} is VALID [2018-11-23 11:45:20,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {1221#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1221#true} is VALID [2018-11-23 11:45:20,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {1221#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000bv32));~sum~0 := 0bv32;~i~0 := 1bv32; {1241#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1241#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= main_~sum~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1245#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {1245#(and (bvsle main_~n~0 (_ bv1000 32)) (= main_~i~0 main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1249#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {1249#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~sum~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1253#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:45:20,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {1253#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1257#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:45:20,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {1257#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1261#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967293 32)) (bvadd (bvneg main_~i~0) main_~sum~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:45:20,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {1261#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967293 32)) (bvadd (bvneg main_~i~0) main_~sum~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~n~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1265#(and (= (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (_ bv5 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:45:20,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {1265#(and (= (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (_ bv5 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1269#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv5 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967295 32)))) (bvmul (_ bv3 32) main_~i~0))) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:45:20,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {1269#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv5 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967295 32)))) (bvmul (_ bv3 32) main_~i~0))) (= (_ bv4 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1273#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv8 32)) (bvadd (bvmul (_ bv3 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {1273#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv8 32)) (bvadd (bvmul (_ bv3 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1277#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))) (_ bv4294967288 32)) (bvadd (bvneg main_~i~0) main_~sum~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))) (_ bv4294967288 32)) (bvadd (bvneg main_~i~0) main_~sum~0)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1281#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv3 32) main_~i~0) (_ bv4294967285 32)) (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)))} is VALID [2018-11-23 11:45:20,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {1281#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv3 32) main_~i~0) (_ bv4294967285 32)) (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1285#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (= (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv3 32) main_~i~0) (_ bv4294967285 32)) (bvadd (bvneg main_~i~0) (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)) (bvsle (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:45:20,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {1285#(and (bvsle main_~n~0 (_ bv1000 32)) (= (_ bv6 32) main_~i~0) (= (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv3 32) main_~i~0) (_ bv4294967285 32)) (bvadd (bvneg main_~i~0) (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0)) (bvsle (_ bv1 32) main_~n~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1289#(and (= (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (bvneg (bvadd main_~i~0 (_ bv4294967294 32))) (_ bv14 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967292 32)))) (bvmul (_ bv3 32) main_~i~0))) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {1289#(and (= (bvadd (bvneg (bvadd main_~i~0 (_ bv4294967295 32))) main_~sum~0 (bvneg (bvadd main_~i~0 (_ bv4294967294 32))) (_ bv14 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967292 32)))) (bvmul (_ bv3 32) main_~i~0))) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1293#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv14 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967295 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967292 32)))) (bvmul (_ bv4 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {1293#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv14 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967295 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967292 32)))) (bvmul (_ bv4 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1297#(and (= (bvadd main_~sum~0 (_ bv18 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967291 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv4 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv8 32) main_~i~0))} is VALID [2018-11-23 11:45:20,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {1297#(and (= (bvadd main_~sum~0 (_ bv18 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967291 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv4 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv8 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1301#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv18 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967291 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv5 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (= (_ bv8 32) main_~i~0))} is VALID [2018-11-23 11:45:20,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {1301#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv18 32)) (bvadd (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967291 32)))) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967293 32)))) (bvmul (_ bv5 32) main_~i~0) (bvneg (bvneg (bvadd main_~i~0 (_ bv4294967294 32)))))) (= (_ bv8 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1305#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967260 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {1305#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967260 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1309#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967260 32)) main_~i~0))} is VALID [2018-11-23 11:45:20,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {1309#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967260 32)) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1313#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967261 32)) main_~i~0) (bvsle (_ bv8 32) main_~n~0) (= (_ bv10 32) main_~i~0))} is VALID [2018-11-23 11:45:20,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {1313#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd main_~sum~0 (_ bv4294967261 32)) main_~i~0) (bvsle (_ bv8 32) main_~n~0) (= (_ bv10 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1317#(and (= (bvadd main_~sum~0 (_ bv4294967261 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (_ bv10 32) main_~i~0))} is VALID [2018-11-23 11:45:20,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {1317#(and (= (bvadd main_~sum~0 (_ bv4294967261 32)) (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (_ bv10 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1321#(and (= (_ bv55 32) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {1321#(and (= (_ bv55 32) main_~sum~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1325#(and (= (bvadd main_~sum~0 (_ bv4294967241 32)) main_~i~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {1325#(and (= (bvadd main_~sum~0 (_ bv4294967241 32)) main_~i~0) (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1329#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv54 32)) main_~sum~0) (= (bvadd main_~sum~0 (_ bv4294967230 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {1329#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv8 32) main_~n~0) (= (bvadd main_~i~0 (_ bv54 32)) main_~sum~0) (= (bvadd main_~sum~0 (_ bv4294967230 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1333#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv54 32)) main_~sum~0) (bvsle main_~i~0 main_~n~0) (= (_ bv12 32) main_~i~0))} is VALID [2018-11-23 11:45:20,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {1333#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv54 32)) main_~sum~0) (bvsle main_~i~0 main_~n~0) (= (_ bv12 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1337#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967244 32)) (bvmul (_ bv2 32) main_~i~0)) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {1337#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967244 32)) (bvmul (_ bv2 32) main_~i~0)) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1341#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv52 32)) main_~sum~0))} is VALID [2018-11-23 11:45:20,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {1341#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv52 32)) main_~sum~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1345#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv49 32)) main_~sum~0) (bvsle (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv14 32) main_~i~0))} is VALID [2018-11-23 11:45:20,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {1345#(and (bvsle main_~n~0 (_ bv1000 32)) (= (bvadd (bvmul (_ bv3 32) main_~i~0) (_ bv49 32)) main_~sum~0) (bvsle (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv14 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1349#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967247 32)) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv14 32) main_~i~0))} is VALID [2018-11-23 11:45:20,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {1349#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967247 32)) (bvmul (_ bv4 32) main_~i~0)) (= (_ bv14 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1353#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv14 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967191 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {1353#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (_ bv14 32) main_~n~0) (= (bvadd main_~sum~0 (_ bv4294967191 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sum~0 := ~bvadd32(~sum~0, ~i~0); {1357#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv105 32)) main_~sum~0) (= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:20,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {1357#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv105 32)) main_~sum~0) (= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1361#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv16 32) main_~i~0) (= (bvadd main_~sum~0 (_ bv4294967192 32)) main_~i~0))} is VALID [2018-11-23 11:45:20,848 INFO L273 TraceCheckUtils]: 36: Hoare triple {1361#(and (bvsle main_~n~0 (_ bv1000 32)) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv16 32) main_~i~0) (= (bvadd main_~sum~0 (_ bv4294967192 32)) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {1365#(and (= (bvadd main_~sum~0 (_ bv4294967176 32)) (_ bv0 32)) (not (bvsle (_ bv16 32) main_~n~0)) (bvsle (_ bv15 32) main_~n~0))} is VALID [2018-11-23 11:45:20,861 INFO L256 TraceCheckUtils]: 37: Hoare triple {1365#(and (= (bvadd main_~sum~0 (_ bv4294967176 32)) (_ bv0 32)) (not (bvsle (_ bv16 32) main_~n~0)) (bvsle (_ bv15 32) main_~n~0))} call __VERIFIER_assert((if ~bvmul32(2bv32, ~sum~0) == ~bvmul32(~n~0, ~bvadd32(1bv32, ~n~0)) then 1bv32 else 0bv32)); {1369#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:20,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {1369#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1373#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:20,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {1373#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1222#false} is VALID [2018-11-23 11:45:20,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2018-11-23 11:45:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:20,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:31,701 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:45:32,948 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:45:34,236 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:45:35,634 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:39,531 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-23 11:45:41,213 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:42,919 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:44,531 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:46,092 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:47,694 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:49,494 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:51,190 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:55,117 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-23 11:45:56,837 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:58,621 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:46:00,500 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:46:02,653 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:46:04,626 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:06,541 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:08,873 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 25