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-lit/bhmr2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:37:58,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:37:58,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:37:58,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:37:58,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:37:58,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:37:58,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:37:58,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:37:58,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:37:58,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:37:58,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:37:58,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:37:58,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:37:58,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:37:58,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:37:58,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:37:58,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:37:58,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:37:58,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:37:58,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:37:58,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:37:58,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:37:58,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:37:58,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:37:58,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:37:58,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:37:58,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:37:58,510 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:37:58,511 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:37:58,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:37:58,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:37:58,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:37:58,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:37:58,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:37:58,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:37:58,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:37:58,516 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:37:58,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:37:58,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:37:58,547 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:37:58,547 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:37:58,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:37:58,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:37:58,549 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:37:58,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:37:58,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:37:58,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:37:58,550 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:37:58,551 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:37:58,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:37:58,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:37:58,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:37:58,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:37:58,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:37:58,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:37:58,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:37:58,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:37:58,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:37:58,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:37:58,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:37:58,554 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:37:58,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:37:58,554 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:37:58,555 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:37:58,555 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:37:58,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:37:58,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:37:58,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:37:58,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:37:58,639 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:37:58,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 11:37:58,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82867cfad/379718600c964d7a9553ca0dc6fb012f/FLAG7e2d1e16c [2018-11-23 11:37:59,127 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:37:59,128 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 11:37:59,134 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82867cfad/379718600c964d7a9553ca0dc6fb012f/FLAG7e2d1e16c [2018-11-23 11:37:59,491 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82867cfad/379718600c964d7a9553ca0dc6fb012f [2018-11-23 11:37:59,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:37:59,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:37:59,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:37:59,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:37:59,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:37:59,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f73a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59, skipping insertion in model container [2018-11-23 11:37:59,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:37:59,552 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:37:59,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:37:59,798 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:37:59,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:37:59,841 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:37:59,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59 WrapperNode [2018-11-23 11:37:59,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:37:59,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:37:59,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:37:59,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:37:59,853 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:37:59" (1/1) ... [2018-11-23 11:37:59,860 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:37:59" (1/1) ... [2018-11-23 11:37:59,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:37:59,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:37:59,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:37:59,868 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:37:59,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (1/1) ... [2018-11-23 11:37:59,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:37:59,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:37:59,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:37:59,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:37:59,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (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:38:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:00,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:00,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:00,507 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:00,507 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:00,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:00 BoogieIcfgContainer [2018-11-23 11:38:00,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:00,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:00,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:00,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:00,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:37:59" (1/3) ... [2018-11-23 11:38:00,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3f8d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:00, skipping insertion in model container [2018-11-23 11:38:00,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:59" (2/3) ... [2018-11-23 11:38:00,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3f8d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:00, skipping insertion in model container [2018-11-23 11:38:00,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:00" (3/3) ... [2018-11-23 11:38:00,517 INFO L112 eAbstractionObserver]: Analyzing ICFG bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 11:38:00,526 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:00,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:00,552 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:00,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:00,585 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:00,585 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:00,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:00,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:00,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:00,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:00,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:00,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:38:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:38:00,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:00,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:00,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:00,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash 439143249, now seen corresponding path program 1 times [2018-11-23 11:38:00,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:00,628 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:38:00,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:00,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:00,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:38:00,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:38:00,782 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #43#return; {24#true} is VALID [2018-11-23 11:38:00,782 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-23 11:38:00,782 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 11:38:00,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {24#true} is VALID [2018-11-23 11:38:00,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:38:00,785 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:38:00,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:38:00,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:38:00,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:38:00,789 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:38:00,789 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:00,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:00,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:38:00,801 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:38:00,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:00,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:38:00,855 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:38:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:38:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:38:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:00,867 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:38:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:00,968 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:38:00,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:38:00,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:38:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 11:38:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 11:38:00,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 11:38:01,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:01,372 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:38:01,372 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:38:01,375 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:38:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:38:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:38:01,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:01,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:01,423 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:01,423 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:01,426 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:38:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:01,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:01,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:01,427 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:01,427 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:01,430 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:38:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:01,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:01,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:01,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:01,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 11:38:01,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-23 11:38:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:01,439 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 11:38:01,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:38:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:38:01,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:01,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:01,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:01,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash 428984518, now seen corresponding path program 1 times [2018-11-23 11:38:01,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:01,443 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:38:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:01,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:01,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {149#true} is VALID [2018-11-23 11:38:01,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2018-11-23 11:38:01,849 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #43#return; {149#true} is VALID [2018-11-23 11:38:01,849 INFO L256 TraceCheckUtils]: 3: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2018-11-23 11:38:01,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {149#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {166#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:01,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {166#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {170#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:01,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {174#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:01,856 INFO L256 TraceCheckUtils]: 7: Hoare triple {174#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {178#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:01,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {178#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {182#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:01,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {182#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {150#false} is VALID [2018-11-23 11:38:01,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2018-11-23 11:38:01,869 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:38:01,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:38:01,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:01,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:38:01,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:38:01,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:01,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:38:01,915 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:38:01,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:38:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:38:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:38:01,917 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-23 11:38:02,585 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:38:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:02,857 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 11:38:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:38:02,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:38:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:38:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 11:38:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:38:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 11:38:02,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2018-11-23 11:38:02,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:02,946 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:38:02,946 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:38:02,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:38:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:38:02,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:02,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 11:38:02,972 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 11:38:02,972 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 11:38:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:02,974 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:38:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:38:02,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:02,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:02,975 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 11:38:02,976 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 11:38:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:02,978 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:38:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:38:02,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:02,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:02,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:02,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 11:38:02,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 11:38:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:02,982 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 11:38:02,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:38:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:38:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:38:02,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:02,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:02,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:02,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash -277157879, now seen corresponding path program 1 times [2018-11-23 11:38:02,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:02,984 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:38:03,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:03,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:03,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:38:03,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:38:03,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #43#return; {278#true} is VALID [2018-11-23 11:38:03,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2018-11-23 11:38:03,488 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {295#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:03,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {295#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {299#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:03,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {303#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:03,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {303#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {307#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:03,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {311#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:03,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {311#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {315#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:03,499 INFO L256 TraceCheckUtils]: 10: Hoare triple {315#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {319#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:03,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {323#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:03,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:38:03,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:38:03,505 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:38:03,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:06,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:38:06,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {333#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:38:06,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {333#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:06,424 INFO L256 TraceCheckUtils]: 10: Hoare triple {341#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {337#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:06,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {341#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:38:06,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {349#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {345#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:07,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {349#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:38:07,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {353#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:38:07,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {361#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {357#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:38:07,232 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {361#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0))))} is VALID [2018-11-23 11:38:07,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2018-11-23 11:38:07,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #43#return; {278#true} is VALID [2018-11-23 11:38:07,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:38:07,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:38:07,236 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:38:07,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:07,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:38:07,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-11-23 11:38:07,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:07,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:38:08,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:38:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:38:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:08,070 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 18 states. [2018-11-23 11:38:08,859 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-23 11:38:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:09,581 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 11:38:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:38:09,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-11-23 11:38:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2018-11-23 11:38:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2018-11-23 11:38:09,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 31 transitions. [2018-11-23 11:38:09,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:09,667 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:38:09,667 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:38:09,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:38:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:38:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:38:09,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:09,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:38:09,687 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:38:09,687 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:38:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:09,689 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:38:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:38:09,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:09,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:09,690 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:38:09,690 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:38:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:09,692 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:38:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:38:09,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:09,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:09,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:09,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:38:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 11:38:09,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-23 11:38:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:09,696 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 11:38:09,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:38:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:38:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:38:09,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:09,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:09,698 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:09,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -608518108, now seen corresponding path program 1 times [2018-11-23 11:38:09,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:09,699 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:38:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:09,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:10,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 11:38:10,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 11:38:10,258 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #43#return; {502#true} is VALID [2018-11-23 11:38:10,258 INFO L256 TraceCheckUtils]: 3: Hoare triple {502#true} call #t~ret3 := main(); {502#true} is VALID [2018-11-23 11:38:10,261 INFO L273 TraceCheckUtils]: 4: Hoare triple {502#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {519#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:10,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {523#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:10,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {523#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:10,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {530#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:10,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {530#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {534#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:10,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {538#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:10,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {542#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:10,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {546#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:10,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {550#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:10,280 INFO L256 TraceCheckUtils]: 13: Hoare triple {550#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {554#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {554#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {558#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {558#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {503#false} is VALID [2018-11-23 11:38:10,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 11:38:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:10,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:14,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-23 11:38:14,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {568#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {503#false} is VALID [2018-11-23 11:38:14,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {572#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {568#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:14,194 INFO L256 TraceCheckUtils]: 13: Hoare triple {576#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {572#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:14,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {580#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {576#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:38:14,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {584#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {580#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:14,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {584#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:38:14,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {592#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {588#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:38:14,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {592#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:38:15,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {600#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {596#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:38:15,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {600#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvslt32(~i~0, ~n~0); {600#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:38:15,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {607#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvsle main_~n~0 (_ bv1000000 32)))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {600#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:38:15,687 INFO L273 TraceCheckUtils]: 4: Hoare triple {502#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {607#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvsle main_~n~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:38:15,687 INFO L256 TraceCheckUtils]: 3: Hoare triple {502#true} call #t~ret3 := main(); {502#true} is VALID [2018-11-23 11:38:15,687 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #43#return; {502#true} is VALID [2018-11-23 11:38:15,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-23 11:38:15,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-23 11:38:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:15,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:15,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:38:15,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-11-23 11:38:15,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:15,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:38:17,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:17,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:38:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:38:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:38:17,646 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 22 states. [2018-11-23 11:38:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,935 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 11:38:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:38:21,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-11-23 11:38:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:38:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-11-23 11:38:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:38:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-11-23 11:38:21,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 40 transitions. [2018-11-23 11:38:23,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:23,270 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:38:23,271 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:38:23,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:38:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:38:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 11:38:23,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:23,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 11:38:23,342 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 11:38:23,342 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 11:38:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:23,345 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:38:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:38:23,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:23,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:23,346 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 11:38:23,346 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 11:38:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:23,348 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:38:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:38:23,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:23,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:23,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:38:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 11:38:23,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2018-11-23 11:38:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:23,352 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 11:38:23,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:38:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:38:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:38:23,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:23,353 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:23,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:23,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1346421015, now seen corresponding path program 2 times [2018-11-23 11:38:23,354 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:23,354 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:38:23,377 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:23,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:23,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:23,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:23,787 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:38:24,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2018-11-23 11:38:24,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {803#true} assume true; {803#true} is VALID [2018-11-23 11:38:24,501 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {803#true} {803#true} #43#return; {803#true} is VALID [2018-11-23 11:38:24,501 INFO L256 TraceCheckUtils]: 3: Hoare triple {803#true} call #t~ret3 := main(); {803#true} is VALID [2018-11-23 11:38:24,502 INFO L273 TraceCheckUtils]: 4: Hoare triple {803#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {820#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:24,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {820#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {824#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:24,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {824#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {824#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:24,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {824#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {831#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:24,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {831#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {835#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:24,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {835#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {839#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:24,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {839#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {843#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:24,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {847#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:24,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {851#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:24,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {851#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {855#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:24,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {855#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {859#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:24,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {859#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {863#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (= (_ bv3 32) main_~a~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:38:24,517 INFO L256 TraceCheckUtils]: 16: Hoare triple {863#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (= (_ bv3 32) main_~a~0) (not (bvslt (_ bv3 32) main_~n~0)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {867#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:24,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {871#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:24,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {871#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {804#false} is VALID [2018-11-23 11:38:24,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {804#false} assume !false; {804#false} is VALID [2018-11-23 11:38:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:24,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:31,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {804#false} assume !false; {804#false} is VALID [2018-11-23 11:38:31,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {881#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {804#false} is VALID [2018-11-23 11:38:31,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {885#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {881#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:31,363 INFO L256 TraceCheckUtils]: 16: Hoare triple {889#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {885#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:31,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {893#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {889#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:38:31,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {893#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:31,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {897#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:38:31,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {905#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {901#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:38:31,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {909#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {905#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:38:32,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {913#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {909#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:38:32,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {917#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {913#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:38:32,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {921#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {917#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:38:34,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {925#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {921#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:38:34,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {925#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:38:34,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {932#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {925#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:38:34,252 INFO L273 TraceCheckUtils]: 4: Hoare triple {803#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {932#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:38:34,252 INFO L256 TraceCheckUtils]: 3: Hoare triple {803#true} call #t~ret3 := main(); {803#true} is VALID [2018-11-23 11:38:34,252 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {803#true} {803#true} #43#return; {803#true} is VALID [2018-11-23 11:38:34,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {803#true} assume true; {803#true} is VALID [2018-11-23 11:38:34,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2018-11-23 11:38:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:34,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:38:34,266 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 20 [2018-11-23 11:38:34,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:34,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:38:36,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:36,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:38:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:38:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:38:36,992 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 28 states. [2018-11-23 11:38:38,070 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:38:45,452 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-23 11:38:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,405 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 11:38:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:38:46,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 20 [2018-11-23 11:38:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:38:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-11-23 11:38:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:38:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-11-23 11:38:46,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 49 transitions. [2018-11-23 11:38:51,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:51,333 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:38:51,333 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:38:51,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:38:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:38:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-11-23 11:38:51,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:51,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 36 states. [2018-11-23 11:38:51,370 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 36 states. [2018-11-23 11:38:51,370 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 36 states. [2018-11-23 11:38:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,373 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 11:38:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:38:51,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,375 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 51 states. [2018-11-23 11:38:51,375 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 51 states. [2018-11-23 11:38:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,378 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 11:38:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:38:51,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:51,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:38:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 11:38:51,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 20 [2018-11-23 11:38:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:51,382 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 11:38:51,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:38:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 11:38:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:38:51,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:51,383 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:51,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash -469015610, now seen corresponding path program 2 times [2018-11-23 11:38:51,384 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:51,384 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:38:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:51,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:51,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:52,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {1212#true} call ULTIMATE.init(); {1212#true} is VALID [2018-11-23 11:38:52,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {1212#true} assume true; {1212#true} is VALID [2018-11-23 11:38:52,161 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1212#true} {1212#true} #43#return; {1212#true} is VALID [2018-11-23 11:38:52,161 INFO L256 TraceCheckUtils]: 3: Hoare triple {1212#true} call #t~ret3 := main(); {1212#true} is VALID [2018-11-23 11:38:52,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {1212#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1229#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:52,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {1229#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1233#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:52,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {1233#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1233#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:52,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {1233#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1240#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:52,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {1240#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1244#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {1244#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {1244#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {1244#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1251#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {1251#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1255#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:38:52,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {1255#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0); {1255#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:38:52,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {1255#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1262#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:38:52,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {1262#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1266#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:52,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {1266#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1270#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:52,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {1270#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1274#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:38:52,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1278#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:38:52,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {1282#(and (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)))} is VALID [2018-11-23 11:38:52,180 INFO L256 TraceCheckUtils]: 19: Hoare triple {1282#(and (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1286#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:52,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {1286#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1290#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:52,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {1290#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1213#false} is VALID [2018-11-23 11:38:52,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {1213#false} assume !false; {1213#false} is VALID [2018-11-23 11:38:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:52,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:01,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {1213#false} assume !false; {1213#false} is VALID [2018-11-23 11:39:01,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {1300#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1213#false} is VALID [2018-11-23 11:39:01,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1300#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:01,251 INFO L256 TraceCheckUtils]: 19: Hoare triple {1308#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1304#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:01,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {1312#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1308#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:39:01,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1312#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:02,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {1320#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1316#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:39:02,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {1324#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1320#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:02,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {1328#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1324#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:03,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {1332#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1328#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:03,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {1332#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvslt32(~i~0, ~n~0); {1332#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:03,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {1339#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1332#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:04,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {1343#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1339#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:04,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {1343#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1343#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:04,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {1350#(or (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1343#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:05,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {1354#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1350#(or (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:05,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {1354#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1354#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:05,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {1361#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1354#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:05,512 INFO L273 TraceCheckUtils]: 4: Hoare triple {1212#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1361#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)))} is VALID [2018-11-23 11:39:05,512 INFO L256 TraceCheckUtils]: 3: Hoare triple {1212#true} call #t~ret3 := main(); {1212#true} is VALID [2018-11-23 11:39:05,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1212#true} {1212#true} #43#return; {1212#true} is VALID [2018-11-23 11:39:05,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {1212#true} assume true; {1212#true} is VALID [2018-11-23 11:39:05,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {1212#true} call ULTIMATE.init(); {1212#true} is VALID [2018-11-23 11:39:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:05,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:05,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:39:05,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-11-23 11:39:05,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:05,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:39:09,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:09,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:39:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:39:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:39:09,346 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 30 states. [2018-11-23 11:39:10,335 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:39:11,122 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:39:11,663 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:39:19,207 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:39:27,878 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-11-23 11:39:28,209 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-11-23 11:39:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:29,366 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2018-11-23 11:39:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:39:29,366 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-11-23 11:39:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:39:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2018-11-23 11:39:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:39:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2018-11-23 11:39:29,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 60 transitions. [2018-11-23 11:39:39,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 57 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:39,405 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:39:39,405 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:39:39,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=402, Invalid=2460, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:39:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:39:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 51. [2018-11-23 11:39:39,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:39,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 51 states. [2018-11-23 11:39:39,630 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 51 states. [2018-11-23 11:39:39,630 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 51 states. [2018-11-23 11:39:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:39,633 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 11:39:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2018-11-23 11:39:39,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:39,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:39,635 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 76 states. [2018-11-23 11:39:39,635 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 76 states. [2018-11-23 11:39:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:39,638 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 11:39:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2018-11-23 11:39:39,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:39,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:39,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:39,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:39:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-11-23 11:39:39,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 23 [2018-11-23 11:39:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:39,642 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-11-23 11:39:39,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:39:39,643 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-11-23 11:39:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:39:39,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:39,644 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:39,644 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:39,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:39,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1853707897, now seen corresponding path program 3 times [2018-11-23 11:39:39,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:39,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:39,670 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:39:39,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:39:39,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:39,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:40,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {1769#true} call ULTIMATE.init(); {1769#true} is VALID [2018-11-23 11:39:40,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {1769#true} assume true; {1769#true} is VALID [2018-11-23 11:39:40,892 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1769#true} {1769#true} #43#return; {1769#true} is VALID [2018-11-23 11:39:40,893 INFO L256 TraceCheckUtils]: 3: Hoare triple {1769#true} call #t~ret3 := main(); {1769#true} is VALID [2018-11-23 11:39:40,893 INFO L273 TraceCheckUtils]: 4: Hoare triple {1769#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1786#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:40,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {1786#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1790#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {1790#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1790#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {1790#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1797#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {1797#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1801#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:40,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {1801#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {1801#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:40,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1801#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1808#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:40,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {1808#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1812#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {1812#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1812#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {1812#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1819#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:40,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {1819#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1823#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:40,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {1823#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {1827#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:40,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {1827#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1831#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:40,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {1831#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1835#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {1835#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1839#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:40,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {1839#(and (= (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1843#(and (= (_ bv9 32) main_~b~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:40,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {1843#(and (= (_ bv9 32) main_~b~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1847#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv9 32) main_~b~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:40,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {1847#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv9 32) main_~b~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {1851#(and (not (bvslt (_ bv5 32) main_~n~0)) (= (_ bv9 32) main_~b~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0))} is VALID [2018-11-23 11:39:40,915 INFO L256 TraceCheckUtils]: 22: Hoare triple {1851#(and (not (bvslt (_ bv5 32) main_~n~0)) (= (_ bv9 32) main_~b~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1855#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:40,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {1855#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1859#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:40,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {1859#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1770#false} is VALID [2018-11-23 11:39:40,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#false} assume !false; {1770#false} is VALID [2018-11-23 11:39:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:40,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:53,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#false} assume !false; {1770#false} is VALID [2018-11-23 11:39:53,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {1869#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1770#false} is VALID [2018-11-23 11:39:53,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {1873#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1869#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:53,714 INFO L256 TraceCheckUtils]: 22: Hoare triple {1877#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1873#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:53,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {1881#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1877#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:39:53,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {1885#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1881#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:39:54,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {1889#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1885#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:39:54,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {1893#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1889#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:54,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {1897#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1893#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:55,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {1901#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1897#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:39:55,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1901#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:55,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {1909#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1905#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:39:56,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {1913#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1909#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:56,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {1913#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1913#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:56,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1913#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:39:57,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {1924#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1920#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:57,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {1924#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1924#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:58,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {1931#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1924#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:39:59,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {1935#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1931#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:39:59,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {1935#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1935#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:39:59,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {1942#(forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32)))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1935#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:39:59,293 INFO L273 TraceCheckUtils]: 4: Hoare triple {1769#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1942#(forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967281 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:39:59,293 INFO L256 TraceCheckUtils]: 3: Hoare triple {1769#true} call #t~ret3 := main(); {1769#true} is VALID [2018-11-23 11:39:59,294 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1769#true} {1769#true} #43#return; {1769#true} is VALID [2018-11-23 11:39:59,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1769#true} assume true; {1769#true} is VALID [2018-11-23 11:39:59,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1769#true} call ULTIMATE.init(); {1769#true} is VALID [2018-11-23 11:39:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:59,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 11:39:59,299 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2018-11-23 11:39:59,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:59,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:40:05,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:05,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:40:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:40:05,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:40:05,408 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 36 states. [2018-11-23 11:40:06,997 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:40:08,020 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:40:09,093 WARN L180 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-11-23 11:40:12,661 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:40:21,238 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 11:40:21,816 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:40:22,235 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:40:23,348 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-23 11:40:34,673 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-11-23 11:40:35,158 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-11-23 11:40:35,627 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-11-23 11:40:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:36,959 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2018-11-23 11:40:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:40:36,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2018-11-23 11:40:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:40:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:40:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-11-23 11:40:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:40:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2018-11-23 11:40:36,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 69 transitions. [2018-11-23 11:40:53,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 65 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:53,226 INFO L225 Difference]: With dead ends: 117 [2018-11-23 11:40:53,226 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:40:53,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=585, Invalid=3447, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:40:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:40:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 66. [2018-11-23 11:40:53,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:40:53,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 66 states. [2018-11-23 11:40:53,343 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 66 states. [2018-11-23 11:40:53,344 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 66 states. [2018-11-23 11:40:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:53,349 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-23 11:40:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2018-11-23 11:40:53,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:53,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:53,350 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 109 states. [2018-11-23 11:40:53,350 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 109 states. [2018-11-23 11:40:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:53,354 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-23 11:40:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2018-11-23 11:40:53,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:53,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:53,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:40:53,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:40:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:40:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2018-11-23 11:40:53,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 26 [2018-11-23 11:40:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:40:53,358 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2018-11-23 11:40:53,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:40:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2018-11-23 11:40:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:40:53,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:40:53,359 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:40:53,360 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:40:53,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:40:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1380357001, now seen corresponding path program 4 times [2018-11-23 11:40:53,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:40:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:40:53,383 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:40:53,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:40:53,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:40:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:40:53,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:40:54,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {2489#true} call ULTIMATE.init(); {2489#true} is VALID [2018-11-23 11:40:54,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {2489#true} assume true; {2489#true} is VALID [2018-11-23 11:40:54,284 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2489#true} {2489#true} #43#return; {2489#true} is VALID [2018-11-23 11:40:54,285 INFO L256 TraceCheckUtils]: 3: Hoare triple {2489#true} call #t~ret3 := main(); {2489#true} is VALID [2018-11-23 11:40:54,285 INFO L273 TraceCheckUtils]: 4: Hoare triple {2489#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2506#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:40:54,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {2506#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {2510#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {2510#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {2510#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {2510#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {2517#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {2517#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2521#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:54,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {2521#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {2521#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:54,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {2521#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2528#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:54,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {2528#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2532#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {2532#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {2532#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {2532#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2539#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:54,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {2539#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2543#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:54,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {2543#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {2547#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:40:54,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {2547#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {2551#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:40:54,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {2551#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2555#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {2555#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {2559#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:40:54,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {2559#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv6 32) main_~b~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2563#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:40:54,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {2563#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2567#(and (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:40:54,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {2567#(and (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {2571#(and (not (bvslt (_ bv5 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0))} is VALID [2018-11-23 11:40:54,307 INFO L256 TraceCheckUtils]: 22: Hoare triple {2571#(and (not (bvslt (_ bv5 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32)) (bvslt (_ bv4 32) main_~n~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {2575#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:54,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2579#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:54,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {2579#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2490#false} is VALID [2018-11-23 11:40:54,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2018-11-23 11:40:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:54,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:41:07,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2018-11-23 11:41:07,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {2589#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2490#false} is VALID [2018-11-23 11:41:07,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {2593#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2589#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:41:07,456 INFO L256 TraceCheckUtils]: 22: Hoare triple {2597#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {2593#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:41:07,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {2601#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {2597#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:41:07,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {2605#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2601#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:41:08,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {2609#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2605#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:41:08,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {2613#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {2609#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:41:08,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {2617#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2613#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:41:10,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {2621#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {2617#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:41:10,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {2625#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {2621#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:41:10,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {2629#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2625#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:41:12,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {2633#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2629#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv6 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is UNKNOWN [2018-11-23 11:41:12,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {2633#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {2633#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:41:12,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {2640#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2633#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-23 11:41:13,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {2644#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2640#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:41:13,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {2644#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {2644#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:41:13,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {2651#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2644#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:41:14,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {2655#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {2651#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv12 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:41:14,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {2655#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {2655#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:41:14,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {2662#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32)))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {2655#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:41:14,498 INFO L273 TraceCheckUtils]: 4: Hoare triple {2489#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2662#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv5 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv15 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:41:14,498 INFO L256 TraceCheckUtils]: 3: Hoare triple {2489#true} call #t~ret3 := main(); {2489#true} is VALID [2018-11-23 11:41:14,498 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2489#true} {2489#true} #43#return; {2489#true} is VALID [2018-11-23 11:41:14,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {2489#true} assume true; {2489#true} is VALID [2018-11-23 11:41:14,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {2489#true} call ULTIMATE.init(); {2489#true} is VALID [2018-11-23 11:41:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:14,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:41:14,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 11:41:14,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2018-11-23 11:41:14,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:14,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:41:19,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:19,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:41:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:41:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:41:19,909 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 36 states. [2018-11-23 11:41:21,146 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:41:22,584 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:41:23,633 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-23 11:41:27,042 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:41:34,172 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:41:34,995 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-11-23 11:41:38,115 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 28