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.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:43:12,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:43:12,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:43:12,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:43:12,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:43:12,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:43:12,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:43:12,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:43:12,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:43:12,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:43:12,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:43:12,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:43:12,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:43:12,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:43:12,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:43:12,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:43:12,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:43:12,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:43:12,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:43:12,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:43:12,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:43:12,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:43:12,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:43:12,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:43:12,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:43:12,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:43:12,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:43:12,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:43:12,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:43:12,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:43:12,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:43:12,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:43:12,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:43:12,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:43:12,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:43:12,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:43:12,471 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:43:12,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:43:12,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:43:12,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:43:12,507 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:43:12,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:43:12,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:43:12,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:43:12,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:43:12,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:43:12,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:43:12,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:43:12,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:43:12,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:43:12,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:43:12,513 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:43:12,513 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:43:12,513 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:43:12,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:43:12,514 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:43:12,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:43:12,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:43:12,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:43:12,514 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:43:12,515 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:43:12,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:43:12,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:43:12,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:43:12,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:43:12,518 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:43:12,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:43:12,518 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:43:12,518 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:43:12,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:43:12,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:43:12,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:43:12,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:43:12,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:43:12,604 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:43:12,605 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.i.v+cfa-reducer.c [2018-11-23 11:43:12,665 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4322325/58fb6d996c1f45b79880ac5169f4a809/FLAG66a8490c0 [2018-11-23 11:43:13,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:43:13,111 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 11:43:13,116 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4322325/58fb6d996c1f45b79880ac5169f4a809/FLAG66a8490c0 [2018-11-23 11:43:13,496 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4322325/58fb6d996c1f45b79880ac5169f4a809 [2018-11-23 11:43:13,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:43:13,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:43:13,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:43:13,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:43:13,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:43:13,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c04e15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13, skipping insertion in model container [2018-11-23 11:43:13,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:43:13,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:43:13,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:43:13,758 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:43:13,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:43:13,798 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:43:13,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13 WrapperNode [2018-11-23 11:43:13,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:43:13,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:43:13,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:43:13,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:43:13,810 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:43:13" (1/1) ... [2018-11-23 11:43:13,817 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:43:13" (1/1) ... [2018-11-23 11:43:13,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:43:13,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:43:13,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:43:13,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:43:13,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (1/1) ... [2018-11-23 11:43:13,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:43:13,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:43:13,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:43:13,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:43:13,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (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:43:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:43:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:43:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:43:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:43:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:43:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:43:14,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:43:14,398 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:43:14,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:43:14 BoogieIcfgContainer [2018-11-23 11:43:14,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:43:14,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:43:14,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:43:14,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:43:14,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:43:13" (1/3) ... [2018-11-23 11:43:14,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ae556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:43:14, skipping insertion in model container [2018-11-23 11:43:14,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:13" (2/3) ... [2018-11-23 11:43:14,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ae556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:43:14, skipping insertion in model container [2018-11-23 11:43:14,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:43:14" (3/3) ... [2018-11-23 11:43:14,412 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 11:43:14,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:43:14,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:43:14,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:43:14,483 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:43:14,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:43:14,484 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:43:14,484 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:43:14,484 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:43:14,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:43:14,485 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:43:14,485 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:43:14,485 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:43:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-23 11:43:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:43:14,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:14,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:14,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:14,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-23 11:43:14,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:14,525 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:43:14,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:43:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:14,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:14,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-23 11:43:14,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {19#true} is VALID [2018-11-23 11:43:14,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-23 11:43:14,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-23 11:43:14,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-23 11:43:14,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-23 11:43:14,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!~bvsle32(1bv32, ~main__n~0); {42#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:14,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-23 11:43:14,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-23 11:43:14,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2018-11-23 11:43:14,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-23 11:43:14,794 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:43:14,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:43:14,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:43:14,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:43:14,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:43:14,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:14,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:43:14,876 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:43:14,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:43:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:43:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:43:14,889 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-23 11:43:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,359 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:43:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:43:15,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:43:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:43:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 11:43:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:43:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 11:43:15,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-23 11:43:15,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:15,483 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:43:15,483 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:43:15,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:43:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:43:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:43:15,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:15,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:43:15,539 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:43:15,539 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:43:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,542 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:43:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:43:15,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:15,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:15,543 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:43:15,543 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:43:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,547 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:43:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:43:15,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:15,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:15,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:15,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:43:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:43:15,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 11:43:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:15,552 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:43:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:43:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:43:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:43:15,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:15,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:15,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:15,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-23 11:43:15,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:15,555 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:43:15,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:43:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:15,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:15,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-23 11:43:15,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {132#true} is VALID [2018-11-23 11:43:15,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-23 11:43:15,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-23 11:43:15,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-23 11:43:15,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-23 11:43:15,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {155#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:15,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-23 11:43:15,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:15,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:16,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-23 11:43:16,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-23 11:43:16,012 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:43:16,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:18,296 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-23 11:43:18,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-23 11:43:18,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-23 11:43:18,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:43:18,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-23 11:43:18,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is VALID [2018-11-23 11:43:18,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} is VALID [2018-11-23 11:43:18,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-23 11:43:18,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-23 11:43:18,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-23 11:43:18,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-23 11:43:18,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {132#true} is VALID [2018-11-23 11:43:18,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-23 11:43:18,408 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:43:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:43:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:43:18,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-23 11:43:18,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:18,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:43:18,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:18,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:43:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:43:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:43:18,545 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-11-23 11:43:19,663 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:43:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:19,790 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:43:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:43:19,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-23 11:43:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:43:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 11:43:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:43:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 11:43:19,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-23 11:43:19,847 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:43:19,849 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:43:19,849 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:43:19,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:43:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:43:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:43:19,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:19,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:43:19,861 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:43:19,861 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:43:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:19,864 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:43:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:43:19,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:19,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:19,865 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:43:19,865 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:43:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:19,866 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:43:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:43:19,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:19,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:19,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:19,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:43:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:43:19,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 11:43:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:19,870 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:43:19,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:43:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:43:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:43:19,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:19,871 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:19,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:19,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 2 times [2018-11-23 11:43:19,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:19,872 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:43:19,888 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:43:19,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:43:19,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:43:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:20,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:20,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 11:43:20,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {299#true} is VALID [2018-11-23 11:43:20,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:43:20,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-23 11:43:20,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-23 11:43:20,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-23 11:43:20,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {322#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:20,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-23 11:43:20,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:20,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:20,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-23 11:43:20,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:20,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-23 11:43:20,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 11:43:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:20,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:23,953 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:43:26,445 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:43:26,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 11:43:26,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-23 11:43:26,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:43:26,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-23 11:43:28,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:43:30,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-23 11:43:30,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is VALID [2018-11-23 11:43:30,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {299#true} is VALID [2018-11-23 11:43:30,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-23 11:43:30,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-23 11:43:30,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-23 11:43:30,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:43:30,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {299#true} is VALID [2018-11-23 11:43:30,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 11:43:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:30,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:43:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:43:30,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-23 11:43:30,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:30,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:43:34,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:34,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:43:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:43:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:43:34,807 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-23 11:43:36,959 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-23 11:43:37,828 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-11-23 11:43:39,030 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-23 11:43:39,485 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:43:41,415 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-23 11:43:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:41,642 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 11:43:41,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:43:41,642 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-23 11:43:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:43:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 11:43:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:43:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 11:43:41,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-23 11:43:46,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:46,147 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:43:46,148 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:43:46,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:43:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:43:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:43:46,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:46,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:43:46,169 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:43:46,169 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:43:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:46,171 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:43:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:43:46,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:46,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:46,172 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:43:46,172 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:43:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:46,174 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:43:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:43:46,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:46,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:46,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:46,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:43:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 11:43:46,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2018-11-23 11:43:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:46,178 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 11:43:46,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:43:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:43:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:43:46,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:46,180 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:46,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:46,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 3 times [2018-11-23 11:43:46,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:46,181 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:43:46,198 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:43:46,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:43:46,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:43:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:46,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:47,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-23 11:43:47,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {519#true} is VALID [2018-11-23 11:43:47,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-23 11:43:47,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-23 11:43:47,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-23 11:43:47,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-23 11:43:47,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {542#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:47,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {542#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-23 11:43:47,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:43:47,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:47,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-23 11:43:47,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} is VALID [2018-11-23 11:43:47,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:47,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:47,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} is VALID [2018-11-23 11:43:47,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} is VALID [2018-11-23 11:43:47,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:47,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-23 11:43:47,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-23 11:43:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:47,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:49,472 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:43:51,878 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:43:56,868 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:43:59,471 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:02,154 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:07,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-23 11:44:07,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-23 11:44:07,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:44:07,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-23 11:44:09,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:44:11,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-23 11:44:13,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:44:15,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:44:17,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-23 11:44:19,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:44:21,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-23 11:44:21,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is VALID [2018-11-23 11:44:21,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {519#true} is VALID [2018-11-23 11:44:21,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-23 11:44:21,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-23 11:44:21,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-23 11:44:21,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-23 11:44:21,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {519#true} is VALID [2018-11-23 11:44:21,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-23 11:44:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:44:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:44:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 11:44:21,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-23 11:44:21,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:44:21,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:44:36,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 24 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-23 11:44:36,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:44:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:44:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:44:36,129 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-11-23 11:44:38,479 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:44:38,963 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:44:39,380 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:44:39,845 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:44:40,338 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:44:42,640 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-23 11:44:44,629 WARN L180 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 11:44:46,213 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 88 [2018-11-23 11:44:47,802 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:44:49,399 WARN L180 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:44:50,922 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:44:52,565 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:44:54,114 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:44:55,413 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:45:00,660 WARN L180 SmtUtils]: Spent 872.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 11:45:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:01,580 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 11:45:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:45:01,580 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-23 11:45:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:45:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-23 11:45:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:45:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-23 11:45:01,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 43 transitions. [2018-11-23 11:45:19,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 36 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:19,220 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:45:19,221 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:45:19,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:45:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:45:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 11:45:19,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:19,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 11:45:19,327 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:45:19,327 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:45:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:19,330 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 11:45:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 11:45:19,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:19,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:19,330 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:45:19,331 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:45:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:19,333 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 11:45:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 11:45:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:19,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:19,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:19,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:45:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 11:45:19,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 19 [2018-11-23 11:45:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:19,336 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 11:45:19,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:45:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 11:45:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:45:19,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:19,339 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:19,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:19,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 4 times [2018-11-23 11:45:19,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:19,341 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:45:19,357 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:45:19,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:45:19,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:45:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:19,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:19,790 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 11:45:21,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-23 11:45:21,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {861#true} is VALID [2018-11-23 11:45:21,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-23 11:45:21,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #28#return; {861#true} is VALID [2018-11-23 11:45:21,129 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret2 := main(); {861#true} is VALID [2018-11-23 11:45:21,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {861#true} is VALID [2018-11-23 11:45:21,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume !!~bvsle32(1bv32, ~main__n~0); {884#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:45:21,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-23 11:45:21,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-23 11:45:21,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} is VALID [2018-11-23 11:45:21,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:21,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} is VALID [2018-11-23 11:45:21,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} is VALID [2018-11-23 11:45:21,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} is VALID [2018-11-23 11:45:21,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} is VALID [2018-11-23 11:45:21,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:45:21,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} is VALID [2018-11-23 11:45:21,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:21,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-23 11:45:21,204 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-23 11:45:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:21,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:26,050 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:45:28,707 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:45:31,517 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:34,308 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:45:37,165 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:40,129 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:43,134 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:46,199 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:49,200 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:52,566 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:55,706 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:45:58,957 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:02,503 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:06,053 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:09,504 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:12,802 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:16,514 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:46:16,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-23 11:46:16,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-23 11:46:16,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:16,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-23 11:46:18,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:20,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-23 11:46:22,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:24,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:26,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-23 11:46:28,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:30,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-23 11:46:32,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is UNKNOWN [2018-11-23 11:46:34,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} is UNKNOWN [2018-11-23 11:46:36,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} is UNKNOWN [2018-11-23 11:46:38,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} is UNKNOWN [2018-11-23 11:46:40,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} is UNKNOWN [2018-11-23 11:46:42,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:44,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} is UNKNOWN [2018-11-23 11:46:46,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} is UNKNOWN [2018-11-23 11:46:48,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {1046#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv34 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv272 32))) (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} is UNKNOWN [2018-11-23 11:46:50,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {1050#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv36 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv306 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv18 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1046#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv34 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv272 32))) (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0)))} is UNKNOWN [2018-11-23 11:46:50,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {1050#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv36 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv306 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv18 32)) main_~main__n~0))} is VALID [2018-11-23 11:46:50,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume !!~bvsle32(1bv32, ~main__n~0); {861#true} is VALID [2018-11-23 11:46:50,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {861#true} is VALID [2018-11-23 11:46:50,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret2 := main(); {861#true} is VALID [2018-11-23 11:46:50,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #28#return; {861#true} is VALID [2018-11-23 11:46:50,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-23 11:46:50,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {861#true} is VALID [2018-11-23 11:46:50,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-23 11:46:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:46:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:46:50,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-11-23 11:46:50,869 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 29 [2018-11-23 11:46:50,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:50,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states.