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/count_by_k_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:42:04,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:42:04,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:42:04,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:42:04,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:42:04,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:42:04,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:42:04,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:42:04,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:42:04,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:42:04,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:42:04,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:42:04,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:42:04,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:42:04,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:42:04,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:42:04,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:42:04,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:42:04,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:42:04,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:42:04,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:42:04,701 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:42:04,704 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:42:04,704 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:42:04,704 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:42:04,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:42:04,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:42:04,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:42:04,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:42:04,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:42:04,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:42:04,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:42:04,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:42:04,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:42:04,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:42:04,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:42:04,712 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:42:04,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:42:04,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:42:04,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:42:04,728 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:42:04,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:42:04,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:42:04,729 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:42:04,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:42:04,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:42:04,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:42:04,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:42:04,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:42:04,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:42:04,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:42:04,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:42:04,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:42:04,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:42:04,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:42:04,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:42:04,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:42:04,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:42:04,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:42:04,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:42:04,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:42:04,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:42:04,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:42:04,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:42:04,816 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:42:04,817 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_k_true-unreach-call_true-termination.i [2018-11-23 11:42:04,873 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f066b1/4f1113cca14e4fb5b95d0b5f57a21660/FLAG906a6eb2a [2018-11-23 11:42:05,330 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:42:05,330 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k_true-unreach-call_true-termination.i [2018-11-23 11:42:05,337 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f066b1/4f1113cca14e4fb5b95d0b5f57a21660/FLAG906a6eb2a [2018-11-23 11:42:05,684 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60f066b1/4f1113cca14e4fb5b95d0b5f57a21660 [2018-11-23 11:42:05,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:42:05,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:42:05,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:42:05,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:42:05,703 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:42:05,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:05" (1/1) ... [2018-11-23 11:42:05,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99eefed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:05, skipping insertion in model container [2018-11-23 11:42:05,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:05" (1/1) ... [2018-11-23 11:42:05,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:42:05,742 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:42:06,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:42:06,030 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:42:06,054 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:42:06,078 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:42:06,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06 WrapperNode [2018-11-23 11:42:06,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:42:06,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:42:06,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:42:06,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:42:06,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:42:06,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:42:06,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:42:06,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:42:06,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... [2018-11-23 11:42:06,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:42:06,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:42:06,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:42:06,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:42:06,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:42:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:42:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:42:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:42:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:42:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:42:06,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:42:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:42:06,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:42:06,721 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:42:06,722 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:42:06,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:06 BoogieIcfgContainer [2018-11-23 11:42:06,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:42:06,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:42:06,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:42:06,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:42:06,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:42:05" (1/3) ... [2018-11-23 11:42:06,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0842a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:06, skipping insertion in model container [2018-11-23 11:42:06,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:06" (2/3) ... [2018-11-23 11:42:06,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0842a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:06, skipping insertion in model container [2018-11-23 11:42:06,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:06" (3/3) ... [2018-11-23 11:42:06,733 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k_true-unreach-call_true-termination.i [2018-11-23 11:42:06,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:42:06,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:42:06,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:42:06,799 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:42:06,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:42:06,800 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:42:06,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:42:06,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:42:06,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:42:06,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:42:06,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:42:06,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:42:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:42:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:42:06,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:06,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:06,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911547, now seen corresponding path program 1 times [2018-11-23 11:42:06,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:06,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:07,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:42:07,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:42:07,092 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-23 11:42:07,093 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-23 11:42:07,093 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-23 11:42:07,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {23#true} is VALID [2018-11-23 11:42:07,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 11:42:07,103 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:42:07,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:42:07,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:42:07,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:42:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:07,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:42:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:42:07,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:42:07,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:42:07,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:07,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:42:07,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:07,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:42:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:42:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:42:07,196 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 11:42:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:07,277 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:42:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:42:07,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:42:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:42:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:42:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:42:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:42:07,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 11:42:07,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:07,674 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:42:07,674 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:42:07,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:42:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:42:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:42:07,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:07,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:07,719 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:07,719 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:07,722 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:42:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:07,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:07,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:07,723 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:07,723 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:42:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:07,726 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:42:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:07,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:07,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:07,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:07,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:42:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:42:07,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 11:42:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:42:07,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:42:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:42:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:42:07,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:07,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:07,733 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:07,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1287452673, now seen corresponding path program 1 times [2018-11-23 11:42:07,734 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:07,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:07,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:08,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2018-11-23 11:42:08,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2018-11-23 11:42:08,083 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #37#return; {144#true} is VALID [2018-11-23 11:42:08,083 INFO L256 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret2 := main(); {144#true} is VALID [2018-11-23 11:42:08,083 INFO L273 TraceCheckUtils]: 4: Hoare triple {144#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2018-11-23 11:42:08,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {144#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {164#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:08,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {164#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {168#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:08,122 INFO L256 TraceCheckUtils]: 7: Hoare triple {168#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {172#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:08,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {172#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {176#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:08,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {176#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {145#false} is VALID [2018-11-23 11:42:08,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#false} assume !false; {145#false} is VALID [2018-11-23 11:42:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:08,126 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:42:08,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:42:08,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:42:08,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:42:08,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:08,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:42:08,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:08,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:42:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:42:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:42:08,191 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 11:42:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:08,514 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:42:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:42:08,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:42:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:42:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 11:42:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:42:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 11:42:08,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 11:42:08,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:08,707 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:42:08,710 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:42:08,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:42:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:42:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 11:42:08,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:08,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:08,785 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:08,786 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-11-23 11:42:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:08,788 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:42:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:42:08,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:08,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:08,789 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-11-23 11:42:08,789 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-11-23 11:42:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:08,791 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:42:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:42:08,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:08,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:08,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:08,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:42:08,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 11:42:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:08,794 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:42:08,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:42:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:42:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:42:08,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:08,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:08,795 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:08,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash 843923389, now seen corresponding path program 1 times [2018-11-23 11:42:08,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:08,796 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:08,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:09,154 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 11:42:09,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:42:09,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:42:09,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #37#return; {266#true} is VALID [2018-11-23 11:42:09,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {266#true} call #t~ret2 := main(); {266#true} is VALID [2018-11-23 11:42:09,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {266#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {266#true} is VALID [2018-11-23 11:42:09,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {286#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:09,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {290#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:09,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {290#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {294#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:09,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {294#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {267#false} is VALID [2018-11-23 11:42:09,298 INFO L256 TraceCheckUtils]: 9: Hoare triple {267#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {267#false} is VALID [2018-11-23 11:42:09,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2018-11-23 11:42:09,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#false} assume 0bv32 == ~cond; {267#false} is VALID [2018-11-23 11:42:09,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:42:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:09,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:09,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:42:09,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#false} assume 0bv32 == ~cond; {267#false} is VALID [2018-11-23 11:42:09,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2018-11-23 11:42:09,527 INFO L256 TraceCheckUtils]: 9: Hoare triple {267#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {267#false} is VALID [2018-11-23 11:42:09,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {267#false} is VALID [2018-11-23 11:42:09,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {322#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:09,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(or (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {326#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:09,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {330#(or (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:42:09,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {266#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {266#true} is VALID [2018-11-23 11:42:09,535 INFO L256 TraceCheckUtils]: 3: Hoare triple {266#true} call #t~ret2 := main(); {266#true} is VALID [2018-11-23 11:42:09,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #37#return; {266#true} is VALID [2018-11-23 11:42:09,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:42:09,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:42:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:42:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:42:09,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-23 11:42:09,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:09,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:42:09,585 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:42:09,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:42:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:42:09,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:42:09,586 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2018-11-23 11:42:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:10,099 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:42:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:42:10,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-23 11:42:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:42:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:42:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:42:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:42:10,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2018-11-23 11:42:10,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:10,311 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:42:10,312 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:42:10,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:42:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:42:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:42:10,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:10,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:42:10,331 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:42:10,331 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:42:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:10,333 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:42:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:42:10,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:10,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:10,335 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:42:10,335 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:42:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:10,337 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:42:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:42:10,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:10,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:10,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:10,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:42:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 11:42:10,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-11-23 11:42:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 11:42:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:42:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:42:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:42:10,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:10,342 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:10,342 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:10,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1549375991, now seen corresponding path program 2 times [2018-11-23 11:42:10,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:42:10,361 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:42:10,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:42:10,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:42:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:10,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:10,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 11:42:10,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 11:42:10,807 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} #37#return; {462#true} is VALID [2018-11-23 11:42:10,808 INFO L256 TraceCheckUtils]: 3: Hoare triple {462#true} call #t~ret2 := main(); {462#true} is VALID [2018-11-23 11:42:10,808 INFO L273 TraceCheckUtils]: 4: Hoare triple {462#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {462#true} is VALID [2018-11-23 11:42:10,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {482#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:10,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {482#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {486#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:10,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {486#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {490#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {490#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {490#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {497#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {497#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {497#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {497#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {504#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {504#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {504#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {511#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:10,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {511#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {463#false} is VALID [2018-11-23 11:42:10,837 INFO L256 TraceCheckUtils]: 15: Hoare triple {463#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {463#false} is VALID [2018-11-23 11:42:10,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-23 11:42:10,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} assume 0bv32 == ~cond; {463#false} is VALID [2018-11-23 11:42:10,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 11:42:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:10,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:11,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 11:42:11,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} assume 0bv32 == ~cond; {463#false} is VALID [2018-11-23 11:42:11,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-23 11:42:11,291 INFO L256 TraceCheckUtils]: 15: Hoare triple {463#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {463#false} is VALID [2018-11-23 11:42:11,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {539#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {463#false} is VALID [2018-11-23 11:42:11,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {539#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:11,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {543#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:13,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {550#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {543#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:13,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {550#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {550#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:15,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {557#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {550#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:15,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {557#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {557#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:17,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {564#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {557#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:17,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#(or (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {564#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:17,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {568#(or (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:17,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {462#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {462#true} is VALID [2018-11-23 11:42:17,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {462#true} call #t~ret2 := main(); {462#true} is VALID [2018-11-23 11:42:17,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} #37#return; {462#true} is VALID [2018-11-23 11:42:17,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 11:42:17,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 11:42:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:17,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:17,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:42:17,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 11:42:17,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:17,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:42:23,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:23,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:42:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:42:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:42:23,440 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 14 states. [2018-11-23 11:42:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:25,113 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:42:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:42:25,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 11:42:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2018-11-23 11:42:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:42:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2018-11-23 11:42:25,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2018-11-23 11:42:31,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:31,258 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:42:31,258 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:42:31,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:42:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:42:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 11:42:31,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:31,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 11:42:31,282 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:42:31,283 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:42:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:31,286 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 11:42:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 11:42:31,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:31,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:31,287 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:42:31,287 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:42:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:31,289 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 11:42:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 11:42:31,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:31,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:31,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:31,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:42:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 11:42:31,293 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2018-11-23 11:42:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:31,293 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 11:42:31,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:42:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 11:42:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:42:31,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:42:31,295 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:42:31,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:42:31,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:42:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1281930219, now seen corresponding path program 3 times [2018-11-23 11:42:31,296 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:42:31,296 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:42:31,317 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:42:31,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:42:31,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:42:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:31,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:32,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 11:42:32,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 11:42:32,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {766#true} {766#true} #37#return; {766#true} is VALID [2018-11-23 11:42:32,364 INFO L256 TraceCheckUtils]: 3: Hoare triple {766#true} call #t~ret2 := main(); {766#true} is VALID [2018-11-23 11:42:32,364 INFO L273 TraceCheckUtils]: 4: Hoare triple {766#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {766#true} is VALID [2018-11-23 11:42:32,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {786#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:32,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {786#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {790#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:42:32,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {794#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {794#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {794#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {794#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {801#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {801#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {801#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {808#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {808#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {815#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {815#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {815#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {815#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {822#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {822#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {822#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {822#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {829#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {829#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {829#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {829#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {836#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:42:32,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {836#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:42:32,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {843#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {843#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {850#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {850#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {850#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {850#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {857#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:32,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {857#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {767#false} is VALID [2018-11-23 11:42:32,434 INFO L256 TraceCheckUtils]: 27: Hoare triple {767#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {767#false} is VALID [2018-11-23 11:42:32,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {767#false} ~cond := #in~cond; {767#false} is VALID [2018-11-23 11:42:32,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {767#false} assume 0bv32 == ~cond; {767#false} is VALID [2018-11-23 11:42:32,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 11:42:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:32,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:34,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 11:42:34,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {767#false} assume 0bv32 == ~cond; {767#false} is VALID [2018-11-23 11:42:34,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {767#false} ~cond := #in~cond; {767#false} is VALID [2018-11-23 11:42:34,320 INFO L256 TraceCheckUtils]: 27: Hoare triple {767#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {767#false} is VALID [2018-11-23 11:42:34,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {885#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {767#false} is VALID [2018-11-23 11:42:34,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {889#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {885#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:34,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {889#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {889#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:36,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {896#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {889#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:36,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {896#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {896#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:38,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {903#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {896#(bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:38,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {903#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {903#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:40,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {910#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {903#(bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:40,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {910#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {910#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:42,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {917#(bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {910#(bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:42,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {917#(bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {917#(bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:44,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#(bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {917#(bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:44,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#(bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {924#(bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:46,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {924#(bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:46,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {931#(bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:48,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {938#(bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {931#(bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:48,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {938#(bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {938#(bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:50,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {938#(bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:50,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {945#(bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {945#(bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:52,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {952#(bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {945#(bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is UNKNOWN [2018-11-23 11:42:52,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {956#(or (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {952#(bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:42:52,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {956#(or (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:42:52,422 INFO L273 TraceCheckUtils]: 4: Hoare triple {766#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {766#true} is VALID [2018-11-23 11:42:52,422 INFO L256 TraceCheckUtils]: 3: Hoare triple {766#true} call #t~ret2 := main(); {766#true} is VALID [2018-11-23 11:42:52,422 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {766#true} {766#true} #37#return; {766#true} is VALID [2018-11-23 11:42:52,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 11:42:52,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 11:42:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:52,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 11:42:52,429 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-11-23 11:42:52,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:52,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:43:10,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 44 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:43:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:43:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:43:10,674 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 26 states. [2018-11-23 11:43:13,732 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:43:14,328 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:43:15,016 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:43:15,587 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:43:16,120 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:43:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:18,179 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 11:43:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:43:18,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-11-23 11:43:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:43:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 72 transitions. [2018-11-23 11:43:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:43:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 72 transitions. [2018-11-23 11:43:18,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 72 transitions. [2018-11-23 11:43:36,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 63 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:36,519 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:43:36,519 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:43:36,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=425, Invalid=835, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:43:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:43:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:43:36,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:36,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:43:36,555 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:43:36,556 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:43:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:36,559 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 11:43:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:43:36,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:36,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:36,561 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:43:36,561 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:43:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:36,564 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 11:43:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:43:36,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:36,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:36,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:36,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:43:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-23 11:43:36,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 31 [2018-11-23 11:43:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:36,568 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-23 11:43:36,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:43:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:43:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:43:36,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:36,570 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:36,571 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:36,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash -417727021, now seen corresponding path program 4 times [2018-11-23 11:43:36,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:43:36,603 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:43:36,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:43:36,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:43:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:36,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:39,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 11:43:39,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 11:43:39,857 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #37#return; {1286#true} is VALID [2018-11-23 11:43:39,857 INFO L256 TraceCheckUtils]: 3: Hoare triple {1286#true} call #t~ret2 := main(); {1286#true} is VALID [2018-11-23 11:43:39,858 INFO L273 TraceCheckUtils]: 4: Hoare triple {1286#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {1286#true} is VALID [2018-11-23 11:43:39,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {1286#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {1306#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:43:39,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {1306#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1310#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:43:39,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {1310#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1314#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {1314#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1314#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {1314#(and (bvsle (_ bv0 32) main_~k~0) (= main_~k~0 main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1321#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {1321#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1321#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {1321#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1328#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {1328#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1328#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {1328#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1335#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {1335#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1335#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1342#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {1342#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1342#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {1342#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1349#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {1349#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1349#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {1349#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= (bvmul (_ bv6 32) main_~k~0) main_~i~0) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1356#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:43:39,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {1356#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1356#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:43:39,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {1356#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv7 32) main_~k~0) main_~i~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1363#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {1363#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1363#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {1363#(and (bvsle (_ bv0 32) main_~k~0) (= (bvmul (_ bv8 32) main_~k~0) main_~i~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1370#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {1370#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1370#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {1370#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1377#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {1377#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1377#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {1377#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1384#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {1384#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1384#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {1384#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1391#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {1391#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1391#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,945 INFO L273 TraceCheckUtils]: 31: Hoare triple {1391#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1398#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {1398#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1398#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {1398#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1405#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv14 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:43:39,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {1405#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv14 32) main_~k~0) main_~i~0))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1405#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv14 32) main_~k~0) main_~i~0))} is VALID [2018-11-23 11:43:39,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {1405#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= (bvmul (_ bv14 32) main_~k~0) main_~i~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1412#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {1412#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1412#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {1412#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1419#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv16 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {1419#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv16 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1419#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv16 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {1419#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv16 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1426#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {1426#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1426#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {1426#(and (bvsle (_ bv0 32) main_~k~0) (= main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1433#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv18 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {1433#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv18 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1433#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv18 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,989 INFO L273 TraceCheckUtils]: 43: Hoare triple {1433#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv18 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1440#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv19 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {1440#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv19 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1440#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv19 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {1440#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv19 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1447#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv20 32) main_~k~0)))} is VALID [2018-11-23 11:43:39,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {1447#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv20 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1447#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv20 32) main_~k~0)))} is VALID [2018-11-23 11:43:40,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {1447#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv20 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1454#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:40,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {1454#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1454#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:43:40,012 INFO L273 TraceCheckUtils]: 49: Hoare triple {1454#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (= main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1461#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv22 32) main_~k~0)))} is VALID [2018-11-23 11:43:40,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {1461#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv10 32)) (bvslt (_ bv0 32) (bvmul (_ bv1000000 32) main_~k~0)) (= main_~i~0 (bvmul (_ bv22 32) main_~k~0)))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1287#false} is VALID [2018-11-23 11:43:40,015 INFO L256 TraceCheckUtils]: 51: Hoare triple {1287#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {1287#false} is VALID [2018-11-23 11:43:40,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2018-11-23 11:43:40,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {1287#false} assume 0bv32 == ~cond; {1287#false} is VALID [2018-11-23 11:43:40,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 11:43:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:40,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:58,010 INFO L273 TraceCheckUtils]: 54: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 11:43:58,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {1287#false} assume 0bv32 == ~cond; {1287#false} is VALID [2018-11-23 11:43:58,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2018-11-23 11:43:58,011 INFO L256 TraceCheckUtils]: 51: Hoare triple {1287#false} call __VERIFIER_assert((if ~i~0 == ~bvmul32(1000000bv32, ~k~0) then 1bv32 else 0bv32)); {1287#false} is VALID [2018-11-23 11:43:58,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {1489#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} assume !~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1287#false} is VALID [2018-11-23 11:43:58,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {1493#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1489#(bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:43:58,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {1497#(or (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1493#(bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))} is VALID [2018-11-23 11:44:00,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {1501#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1497#(or (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:00,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {1505#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1501#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:02,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {1509#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1505#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:02,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {1509#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1509#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:04,040 INFO L273 TraceCheckUtils]: 43: Hoare triple {1516#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1509#(or (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:04,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {1516#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1516#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:06,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {1523#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1516#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:06,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {1523#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1523#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:08,057 INFO L273 TraceCheckUtils]: 39: Hoare triple {1530#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1523#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:08,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {1534#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1530#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:10,064 INFO L273 TraceCheckUtils]: 37: Hoare triple {1538#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1534#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:10,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {1538#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1538#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:12,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {1545#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1538#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 main_~k~0) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:12,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {1545#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1545#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:14,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {1552#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1545#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv2 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:14,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {1552#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1552#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:16,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {1559#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1552#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv3 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:16,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {1559#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1559#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:18,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1559#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv4 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:18,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {1566#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1566#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:20,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {1573#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1566#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv5 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:20,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {1573#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1573#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:22,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {1580#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1573#(or (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv6 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:22,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {1580#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1580#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:24,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {1587#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1580#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv7 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:24,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {1587#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1587#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:26,120 INFO L273 TraceCheckUtils]: 21: Hoare triple {1594#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1587#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv8 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:26,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1594#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1594#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:28,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {1601#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1594#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv9 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:28,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {1601#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1601#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:30,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1608#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1601#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv10 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:30,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {1608#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1608#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:32,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {1615#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1608#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv11 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:32,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {1615#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1615#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:34,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {1622#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1615#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv12 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:34,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {1622#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1622#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:36,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {1629#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1622#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv17 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv13 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:36,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {1629#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1629#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:38,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {1636#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1629#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv18 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv14 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is UNKNOWN [2018-11-23 11:44:38,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {1636#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1636#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is VALID [2018-11-23 11:44:40,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv22 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} ~i~0 := ~bvadd32(~i~0, ~k~0); {1636#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv15 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv19 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)))} is UNKNOWN [2018-11-23 11:44:40,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {1647#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv22 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~bvmul32(1000000bv32, ~k~0)); {1643#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv22 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:40,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {1286#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 10bv32));~i~0 := 0bv32; {1647#(or (not (bvslt (bvadd main_~i~0 (bvmul (_ bv16 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv21 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))) (bvslt (bvadd main_~i~0 (bvmul (_ bv22 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0)) (not (bvslt main_~i~0 (bvmul (_ bv1000000 32) main_~k~0))) (not (bvslt (bvadd main_~i~0 (bvmul (_ bv20 32) main_~k~0)) (bvmul (_ bv1000000 32) main_~k~0))))} is VALID [2018-11-23 11:44:40,177 INFO L273 TraceCheckUtils]: 4: Hoare triple {1286#true} havoc ~i~0;havoc ~k~0;~k~0 := #t~nondet1;havoc #t~nondet1; {1286#true} is VALID [2018-11-23 11:44:40,177 INFO L256 TraceCheckUtils]: 3: Hoare triple {1286#true} call #t~ret2 := main(); {1286#true} is VALID [2018-11-23 11:44:40,177 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #37#return; {1286#true} is VALID [2018-11-23 11:44:40,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 11:44:40,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 11:44:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:44:40,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:44:40,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 53 [2018-11-23 11:44:40,209 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 55 [2018-11-23 11:44:40,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:44:40,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 11:45:22,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 80 inductive. 0 not inductive. 21 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:22,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 11:45:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 11:45:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=2002, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:45:22,852 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2018-11-23 11:45:39,017 WARN L180 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 134 DAG size of output: 92