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/hhk2008_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:39:12,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:39:12,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:39:12,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:39:12,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:39:12,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:39:12,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:39:12,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:39:12,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:39:12,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:39:12,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:39:12,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:39:12,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:39:12,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:39:12,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:39:12,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:39:12,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:39:12,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:39:12,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:39:12,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:39:12,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:39:12,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:39:12,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:39:12,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:39:12,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:39:12,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:39:12,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:39:12,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:39:12,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:39:12,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:39:12,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:39:12,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:39:12,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:39:12,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:39:12,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:39:12,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:39:12,597 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:39:12,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:39:12,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:39:12,614 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:39:12,614 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:39:12,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:39:12,615 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:39:12,615 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:39:12,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:39:12,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:39:12,616 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:39:12,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:39:12,616 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:39:12,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:39:12,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:39:12,617 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:39:12,617 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:39:12,617 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:39:12,617 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:39:12,617 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:39:12,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:39:12,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:39:12,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:39:12,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:39:12,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:39:12,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:39:12,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:39:12,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:39:12,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:39:12,620 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:39:12,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:39:12,620 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:39:12,620 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:39:12,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:39:12,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:39:12,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:39:12,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:39:12,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:39:12,684 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:39:12,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 11:39:12,745 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872563aa0/7513bc0c292b4fd3b38ebb3da2d25e4a/FLAGbeae8b4e6 [2018-11-23 11:39:13,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:39:13,205 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 11:39:13,213 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872563aa0/7513bc0c292b4fd3b38ebb3da2d25e4a/FLAGbeae8b4e6 [2018-11-23 11:39:13,561 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872563aa0/7513bc0c292b4fd3b38ebb3da2d25e4a [2018-11-23 11:39:13,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:39:13,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:39:13,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:39:13,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:39:13,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:39:13,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:13,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ae6c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13, skipping insertion in model container [2018-11-23 11:39:13,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:13,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:39:13,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:39:13,904 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:39:13,910 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:39:13,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:39:13,957 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:39:13,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13 WrapperNode [2018-11-23 11:39:13,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:39:13,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:39:13,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:39:13,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:39:13,970 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:39:13" (1/1) ... [2018-11-23 11:39:13,979 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:39:13" (1/1) ... [2018-11-23 11:39:13,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:39:13,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:39:13,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:39:13,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:39:13,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:13,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... [2018-11-23 11:39:14,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:39:14,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:39:14,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:39:14,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:39:14,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:39:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:39:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:39:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:39:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:39:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:39:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:39:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:39:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:39:14,611 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:39:14,611 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:39:14,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:39:14 BoogieIcfgContainer [2018-11-23 11:39:14,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:39:14,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:39:14,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:39:14,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:39:14,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:39:13" (1/3) ... [2018-11-23 11:39:14,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813cae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:39:14, skipping insertion in model container [2018-11-23 11:39:14,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:13" (2/3) ... [2018-11-23 11:39:14,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813cae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:39:14, skipping insertion in model container [2018-11-23 11:39:14,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:39:14" (3/3) ... [2018-11-23 11:39:14,621 INFO L112 eAbstractionObserver]: Analyzing ICFG hhk2008_true-unreach-call_true-termination.c.i [2018-11-23 11:39:14,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:39:14,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:39:14,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:39:14,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:39:14,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:39:14,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:39:14,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:39:14,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:39:14,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:39:14,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:39:14,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:39:14,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:39:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:39:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:39:14,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:14,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:14,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:14,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1632835705, now seen corresponding path program 1 times [2018-11-23 11:39:14,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:14,754 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:39:14,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:14,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:15,100 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-23 11:39:15,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:39:15,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:39:15,336 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #40#return; {23#true} is VALID [2018-11-23 11:39:15,336 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 11:39:15,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {23#true} is VALID [2018-11-23 11:39:15,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!~bvsle32(~a~0, 1000000bv32); {23#true} is VALID [2018-11-23 11:39:15,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {46#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:15,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !~bvsgt32(~cnt~0, 0bv32); {50#(and (= main_~a~0 main_~res~0) (not (bvsgt main_~b~0 (_ bv0 32))) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:15,345 INFO L256 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~a~0 main_~res~0) (not (bvsgt main_~b~0 (_ bv0 32))) (bvsle (_ bv0 32) main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:15,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:15,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:39:15,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:39:15,356 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:39:15,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:15,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:39:15,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:39:15,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:15,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:39:15,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:15,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:39:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:39:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:39:15,462 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-11-23 11:39:15,859 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-23 11:39:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:16,538 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:39:16,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:39:16,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:39:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:39:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:39:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:39:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:39:16,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 11:39:16,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:16,837 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:39:16,837 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:39:16,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:39:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:39:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:39:16,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:16,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:16,889 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:16,889 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:16,893 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:39:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:16,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:16,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:16,895 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:16,895 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:16,901 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:39:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:16,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:16,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:16,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:16,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:39:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:39:16,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 11:39:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:16,911 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:39:16,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:39:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:39:16,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:16,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:16,913 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:16,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash -886162946, now seen corresponding path program 1 times [2018-11-23 11:39:16,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:16,915 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:39:16,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:17,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:17,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2018-11-23 11:39:17,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2018-11-23 11:39:17,379 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #40#return; {171#true} is VALID [2018-11-23 11:39:17,379 INFO L256 TraceCheckUtils]: 3: Hoare triple {171#true} call #t~ret3 := main(); {171#true} is VALID [2018-11-23 11:39:17,380 INFO L273 TraceCheckUtils]: 4: Hoare triple {171#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {171#true} is VALID [2018-11-23 11:39:17,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#true} assume !!~bvsle32(~a~0, 1000000bv32); {191#(bvsle main_~a~0 (_ bv1000000 32))} is VALID [2018-11-23 11:39:17,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(bvsle main_~a~0 (_ bv1000000 32))} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {195#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:17,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {195#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {199#(and (bvsgt main_~b~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:39:17,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {199#(and (bvsgt main_~b~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)))} assume !~bvsgt32(~cnt~0, 0bv32); {203#(and (bvsgt main_~b~0 (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:17,437 INFO L256 TraceCheckUtils]: 9: Hoare triple {203#(and (bvsgt main_~b~0 (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {207#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:17,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {211#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:17,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {211#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {172#false} is VALID [2018-11-23 11:39:17,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {172#false} assume !false; {172#false} is VALID [2018-11-23 11:39:17,441 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:39:17,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:18,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {172#false} assume !false; {172#false} is VALID [2018-11-23 11:39:18,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {172#false} is VALID [2018-11-23 11:39:18,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {221#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:18,194 INFO L256 TraceCheckUtils]: 9: Hoare triple {229#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {225#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:18,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} assume !~bvsgt32(~cnt~0, 0bv32); {229#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:39:18,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {233#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:18,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {171#true} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {237#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} is VALID [2018-11-23 11:39:18,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#true} assume !!~bvsle32(~a~0, 1000000bv32); {171#true} is VALID [2018-11-23 11:39:18,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {171#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {171#true} is VALID [2018-11-23 11:39:18,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {171#true} call #t~ret3 := main(); {171#true} is VALID [2018-11-23 11:39:18,214 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #40#return; {171#true} is VALID [2018-11-23 11:39:18,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2018-11-23 11:39:18,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2018-11-23 11:39:18,216 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:39:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:18,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:39:18,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 11:39:18,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:18,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:39:18,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:39:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:39:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:39:18,317 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 11:39:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:19,619 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:39:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:39:19,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 11:39:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:39:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 11:39:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:39:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 11:39:19,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2018-11-23 11:39:19,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:19,806 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:39:19,806 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:39:19,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:39:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:39:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:39:19,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:19,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:19,826 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:19,828 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:39:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:19,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:19,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:19,829 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:19,829 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:19,831 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:39:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:19,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:19,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:19,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:19,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:39:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 11:39:19,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-23 11:39:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:19,834 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 11:39:19,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:39:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:39:19,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:19,835 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:19,836 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:19,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1882074695, now seen corresponding path program 2 times [2018-11-23 11:39:19,837 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:19,837 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:39:19,853 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:19,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:39:19,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:20,629 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-23 11:39:20,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-23 11:39:20,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-23 11:39:20,701 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {372#true} {372#true} #40#return; {372#true} is VALID [2018-11-23 11:39:20,702 INFO L256 TraceCheckUtils]: 3: Hoare triple {372#true} call #t~ret3 := main(); {372#true} is VALID [2018-11-23 11:39:20,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {372#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {372#true} is VALID [2018-11-23 11:39:20,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} assume !!~bvsle32(~a~0, 1000000bv32); {392#(bvsle main_~a~0 (_ bv1000000 32))} is VALID [2018-11-23 11:39:20,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(bvsle main_~a~0 (_ bv1000000 32))} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {396#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:20,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {400#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:20,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {404#(and (= (bvadd main_~a~0 (_ bv2 32)) main_~res~0) (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:20,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(and (= (bvadd main_~a~0 (_ bv2 32)) main_~res~0) (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {408#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967293 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:20,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967293 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {412#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} is VALID [2018-11-23 11:39:20,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} assume !~bvsgt32(~cnt~0, 0bv32); {416#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0))} is VALID [2018-11-23 11:39:20,887 INFO L256 TraceCheckUtils]: 12: Hoare triple {416#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32))) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {420#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:20,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {420#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {424#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:20,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {424#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {373#false} is VALID [2018-11-23 11:39:20,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-23 11:39:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:20,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:22,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-23 11:39:22,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {434#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {373#false} is VALID [2018-11-23 11:39:22,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {434#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:22,137 INFO L256 TraceCheckUtils]: 12: Hoare triple {442#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {438#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:22,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {446#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} assume !~bvsgt32(~cnt~0, 0bv32); {442#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:39:22,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {450#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {446#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:22,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {454#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {450#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} is VALID [2018-11-23 11:39:22,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {454#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:22,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {458#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:22,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#true} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {462#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:22,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} assume !!~bvsle32(~a~0, 1000000bv32); {372#true} is VALID [2018-11-23 11:39:22,233 INFO L273 TraceCheckUtils]: 4: Hoare triple {372#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {372#true} is VALID [2018-11-23 11:39:22,233 INFO L256 TraceCheckUtils]: 3: Hoare triple {372#true} call #t~ret3 := main(); {372#true} is VALID [2018-11-23 11:39:22,234 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {372#true} {372#true} #40#return; {372#true} is VALID [2018-11-23 11:39:22,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-23 11:39:22,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-23 11:39:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:22,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 11:39:22,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-11-23 11:39:22,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:22,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:39:22,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:22,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:39:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:39:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:39:22,536 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2018-11-23 11:39:25,425 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:39:25,916 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-11-23 11:39:29,764 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:39:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:29,928 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:39:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:39:29,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-11-23 11:39:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:39:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-11-23 11:39:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:39:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-11-23 11:39:29,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 34 transitions. [2018-11-23 11:39:31,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:31,362 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:39:31,362 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:39:31,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:39:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:39:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:39:31,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:31,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:31,442 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:31,442 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:31,445 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 11:39:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:31,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:31,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:31,446 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:31,446 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:31,448 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 11:39:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:31,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:31,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:31,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:31,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:39:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 11:39:31,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2018-11-23 11:39:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:31,452 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 11:39:31,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:39:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:39:31,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:31,453 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:31,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:31,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:31,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1731495015, now seen corresponding path program 3 times [2018-11-23 11:39:31,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:31,454 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:39:31,476 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:39:31,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:39:31,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:31,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:33,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2018-11-23 11:39:33,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2018-11-23 11:39:33,709 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #40#return; {641#true} is VALID [2018-11-23 11:39:33,709 INFO L256 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret3 := main(); {641#true} is VALID [2018-11-23 11:39:33,710 INFO L273 TraceCheckUtils]: 4: Hoare triple {641#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {641#true} is VALID [2018-11-23 11:39:33,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {641#true} assume !!~bvsle32(~a~0, 1000000bv32); {661#(bvsle main_~a~0 (_ bv1000000 32))} is VALID [2018-11-23 11:39:33,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {661#(bvsle main_~a~0 (_ bv1000000 32))} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {665#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:33,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {665#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {669#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:33,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {669#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {673#(and (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967294 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:33,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {673#(and (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967294 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {677#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv3 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:33,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv3 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {681#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} is VALID [2018-11-23 11:39:33,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {681#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {685#(and (= (bvadd main_~cnt~0 (_ bv5 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967291 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:33,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {685#(and (= (bvadd main_~cnt~0 (_ bv5 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967291 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {689#(and (bvsgt (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967290 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv6 32)) main_~b~0))} is VALID [2018-11-23 11:39:34,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {689#(and (bvsgt (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967290 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv6 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {693#(and (= (bvadd main_~res~0 (_ bv4294967289 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967289 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:34,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {693#(and (= (bvadd main_~res~0 (_ bv4294967289 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967289 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {697#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967288 32)) main_~a~0) (= (bvadd main_~cnt~0 (_ bv8 32)) main_~b~0))} is VALID [2018-11-23 11:39:34,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {697#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967288 32)) main_~a~0) (= (bvadd main_~cnt~0 (_ bv8 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {701#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv9 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv9 32)) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:34,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {701#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv9 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv9 32)) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {705#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967286 32)) main_~cnt~0) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsgt (bvadd main_~b~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:39:34,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967286 32)) main_~cnt~0) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsgt (bvadd main_~b~0 (_ bv4294967287 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0))} assume !~bvsgt32(~cnt~0, 0bv32); {709#(and (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsgt (bvadd main_~b~0 (_ bv4294967287 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967286 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:34,193 INFO L256 TraceCheckUtils]: 18: Hoare triple {709#(and (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsgt (bvadd main_~b~0 (_ bv4294967287 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967286 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {713#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:34,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {713#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {717#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:34,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {717#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {642#false} is VALID [2018-11-23 11:39:34,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {642#false} assume !false; {642#false} is VALID [2018-11-23 11:39:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:34,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:38,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {642#false} assume !false; {642#false} is VALID [2018-11-23 11:39:38,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {727#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {642#false} is VALID [2018-11-23 11:39:38,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {731#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {727#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:38,676 INFO L256 TraceCheckUtils]: 18: Hoare triple {735#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {731#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:38,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {739#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} assume !~bvsgt32(~cnt~0, 0bv32); {735#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:39:38,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {739#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:38,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {747#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {743#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} is VALID [2018-11-23 11:39:38,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {751#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {747#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:38,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {755#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {751#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:38,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {759#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv5 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {755#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:38,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv6 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {759#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv5 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:38,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {767#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv7 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {763#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv6 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:38,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {771#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv8 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {767#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv7 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:38,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {775#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv9 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {771#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv8 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:38,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {779#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967286 32)) main_~res~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {775#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv9 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:39:38,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {641#true} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {779#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967286 32)) main_~res~0))} is VALID [2018-11-23 11:39:38,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {641#true} assume !!~bvsle32(~a~0, 1000000bv32); {641#true} is VALID [2018-11-23 11:39:38,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {641#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {641#true} is VALID [2018-11-23 11:39:38,990 INFO L256 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret3 := main(); {641#true} is VALID [2018-11-23 11:39:38,990 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #40#return; {641#true} is VALID [2018-11-23 11:39:38,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2018-11-23 11:39:38,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2018-11-23 11:39:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:38,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:38,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-11-23 11:39:38,994 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 22 [2018-11-23 11:39:38,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:38,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:39:39,766 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:39:39,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:39:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:39:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:39:39,768 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 31 states. [2018-11-23 11:39:58,513 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 11:39:59,792 WARN L180 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2018-11-23 11:40:10,661 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 11:40:19,712 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:40:27,682 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:40:33,707 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:40:38,577 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:40:42,056 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:40:44,728 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:41:01,327 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-23 11:41:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:01,584 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 11:41:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:41:01,585 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 22 [2018-11-23 11:41:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:41:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2018-11-23 11:41:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:41:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2018-11-23 11:41:01,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 52 transitions. [2018-11-23 11:41:11,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:11,272 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:41:11,273 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:41:11,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 81.1s TimeCoverageRelationStatistics Valid=576, Invalid=1586, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:41:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:41:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:41:11,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:11,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:41:11,657 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:41:11,657 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:41:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:11,659 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 11:41:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:41:11,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:11,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:11,660 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:41:11,661 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:41:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:11,663 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 11:41:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:41:11,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:11,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:11,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:11,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:41:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 11:41:11,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2018-11-23 11:41:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:11,666 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 11:41:11,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:41:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:41:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:41:11,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:11,668 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:11,668 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:11,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 385881945, now seen corresponding path program 4 times [2018-11-23 11:41:11,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:11,669 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:41:11,692 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:41:11,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:41:11,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:41:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:13,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:18,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2018-11-23 11:41:18,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {1042#true} assume true; {1042#true} is VALID [2018-11-23 11:41:18,588 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1042#true} {1042#true} #40#return; {1042#true} is VALID [2018-11-23 11:41:18,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {1042#true} call #t~ret3 := main(); {1042#true} is VALID [2018-11-23 11:41:18,588 INFO L273 TraceCheckUtils]: 4: Hoare triple {1042#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {1042#true} is VALID [2018-11-23 11:41:18,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {1042#true} assume !!~bvsle32(~a~0, 1000000bv32); {1062#(bvsle main_~a~0 (_ bv1000000 32))} is VALID [2018-11-23 11:41:18,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {1062#(bvsle main_~a~0 (_ bv1000000 32))} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {1066#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:18,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {1066#(and (= main_~a~0 main_~res~0) (= main_~b~0 main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1070#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:18,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {1070#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967295 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1074#(and (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967294 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:18,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(and (= (bvadd main_~cnt~0 (_ bv2 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967294 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1078#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967293 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:18,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(and (= (bvadd main_~b~0 (_ bv4294967293 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967293 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1082#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} is VALID [2018-11-23 11:41:18,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(and (bvsgt (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967292 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv4 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1086#(and (= (bvadd main_~cnt~0 (_ bv5 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv5 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:18,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {1086#(and (= (bvadd main_~cnt~0 (_ bv5 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv5 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1090#(and (bvsgt (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967290 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv6 32)) main_~b~0))} is VALID [2018-11-23 11:41:18,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(and (bvsgt (bvadd main_~b~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967290 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv6 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1094#(and (= (bvadd main_~res~0 (_ bv4294967289 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967289 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:18,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {1094#(and (= (bvadd main_~res~0 (_ bv4294967289 32)) main_~a~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967289 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1098#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967288 32)) main_~a~0) (= (bvadd main_~cnt~0 (_ bv8 32)) main_~b~0))} is VALID [2018-11-23 11:41:19,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {1098#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967289 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967288 32)) main_~a~0) (= (bvadd main_~cnt~0 (_ bv8 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1102#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967287 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv9 32)) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:19,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {1102#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967287 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv9 32)) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1106#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967286 32)) main_~cnt~0) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:19,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {1106#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967286 32)) main_~cnt~0) (= (bvadd main_~a~0 (_ bv10 32)) main_~res~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1110#(and (bvsgt (bvadd main_~b~0 (_ bv4294967286 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967285 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967285 32)) main_~cnt~0))} is VALID [2018-11-23 11:41:19,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {1110#(and (bvsgt (bvadd main_~b~0 (_ bv4294967286 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967285 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967285 32)) main_~cnt~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1114#(and (= (bvadd main_~cnt~0 (_ bv12 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967284 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967285 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:19,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {1114#(and (= (bvadd main_~cnt~0 (_ bv12 32)) main_~b~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967284 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967285 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1118#(and (= (bvadd main_~b~0 (_ bv4294967283 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~a~0 (_ bv13 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:19,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {1118#(and (= (bvadd main_~b~0 (_ bv4294967283 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~a~0 (_ bv13 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1122#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967282 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967282 32)) main_~a~0))} is VALID [2018-11-23 11:41:19,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {1122#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967282 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~res~0 (_ bv4294967282 32)) main_~a~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1126#(and (bvsgt (bvadd main_~b~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv15 32)) main_~res~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967281 32)) main_~cnt~0))} is VALID [2018-11-23 11:41:19,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1126#(and (bvsgt (bvadd main_~b~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv15 32)) main_~res~0) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967281 32)) main_~cnt~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1130#(and (= (bvadd main_~res~0 (_ bv4294967280 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967281 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967280 32)) main_~cnt~0))} is VALID [2018-11-23 11:41:19,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {1130#(and (= (bvadd main_~res~0 (_ bv4294967280 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967281 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~b~0 (_ bv4294967280 32)) main_~cnt~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1134#(and (= (bvadd main_~a~0 (_ bv17 32)) main_~res~0) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~cnt~0 (_ bv17 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967280 32)) (_ bv0 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:19,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {1134#(and (= (bvadd main_~a~0 (_ bv17 32)) main_~res~0) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~cnt~0 (_ bv17 32)) main_~b~0) (bvsgt (bvadd main_~b~0 (_ bv4294967280 32)) (_ bv0 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1138#(and (bvsgt (bvadd main_~b~0 (_ bv4294967279 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967278 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967278 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:19,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {1138#(and (bvsgt (bvadd main_~b~0 (_ bv4294967279 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967278 32)) main_~cnt~0) (= (bvadd main_~res~0 (_ bv4294967278 32)) main_~a~0) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1142#(and (bvsgt (bvadd main_~b~0 (_ bv4294967278 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv19 32)) main_~res~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv19 32)) main_~b~0))} is VALID [2018-11-23 11:41:19,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {1142#(and (bvsgt (bvadd main_~b~0 (_ bv4294967278 32)) (_ bv0 32)) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~a~0 (_ bv19 32)) main_~res~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (= (bvadd main_~cnt~0 (_ bv19 32)) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1146#(and (= (bvadd main_~b~0 (_ bv4294967276 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967276 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:19,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {1146#(and (= (bvadd main_~b~0 (_ bv4294967276 32)) main_~cnt~0) (bvsle main_~a~0 (_ bv1000000 32)) (= (bvadd main_~res~0 (_ bv4294967276 32)) main_~a~0) (bvsle main_~b~0 (_ bv1000000 32)) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1150#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967276 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv21 32)) main_~res~0) (= (bvadd main_~cnt~0 (_ bv21 32)) main_~b~0) (bvsle (_ bv0 32) main_~b~0))} is VALID [2018-11-23 11:41:19,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {1150#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (bvsgt (bvadd main_~b~0 (_ bv4294967276 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv21 32)) main_~res~0) (= (bvadd main_~cnt~0 (_ bv21 32)) main_~b~0) (bvsle (_ bv0 32) main_~b~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1154#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967274 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967274 32)) main_~a~0))} is VALID [2018-11-23 11:41:19,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {1154#(and (bvsle main_~a~0 (_ bv1000000 32)) (bvsle main_~b~0 (_ bv1000000 32)) (= (bvadd main_~b~0 (_ bv4294967274 32)) main_~cnt~0) (bvsle (_ bv0 32) main_~b~0) (bvsgt (bvadd main_~cnt~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4294967274 32)) main_~a~0))} assume !~bvsgt32(~cnt~0, 0bv32); {1158#(and (bvsle main_~a~0 (_ bv1000000 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967274 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv4294967274 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967275 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:19,778 INFO L256 TraceCheckUtils]: 30: Hoare triple {1158#(and (bvsle main_~a~0 (_ bv1000000 32)) (not (bvsgt (bvadd main_~b~0 (_ bv4294967274 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv4294967274 32)) main_~a~0) (bvsgt (bvadd main_~b~0 (_ bv4294967275 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {1162#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:19,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {1162#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1166#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:19,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {1166#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1043#false} is VALID [2018-11-23 11:41:19,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2018-11-23 11:41:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:19,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:41:38,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2018-11-23 11:41:38,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {1176#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1043#false} is VALID [2018-11-23 11:41:38,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {1180#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1176#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:41:38,195 INFO L256 TraceCheckUtils]: 30: Hoare triple {1184#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~bvadd32(~a~0, ~b~0) then 1bv32 else 0bv32)); {1180#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:41:38,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {1188#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} assume !~bvsgt32(~cnt~0, 0bv32); {1184#(= main_~res~0 (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-23 11:41:38,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {1192#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1188#(or (bvsgt main_~cnt~0 (_ bv0 32)) (= main_~res~0 (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:38,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {1196#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1192#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv1 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt main_~cnt~0 (_ bv0 32))))} is VALID [2018-11-23 11:41:38,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {1200#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1196#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv2 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:38,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {1204#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1200#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv3 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:38,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {1208#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv5 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1204#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv4 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:38,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {1212#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv6 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1208#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv5 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:38,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv7 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1212#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967291 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv6 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:38,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {1220#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv8 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1216#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967290 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv7 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:38,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {1224#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv9 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1220#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967289 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv8 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:38,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {1228#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967286 32)) main_~res~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1224#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967288 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv9 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:38,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {1232#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv11 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967285 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1228#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967287 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967286 32)) main_~res~0))} is VALID [2018-11-23 11:41:38,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {1236#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967285 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967284 32)) (_ bv0 32)) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967284 32)) main_~res~0))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1232#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967286 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv11 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967285 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:40,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967284 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv13 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967283 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1236#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967285 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967284 32)) (_ bv0 32)) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967284 32)) main_~res~0))} is VALID [2018-11-23 11:41:40,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {1244#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967283 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967282 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967282 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1240#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967284 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv13 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967283 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:40,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {1248#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967281 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967282 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv15 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1244#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967283 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967282 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967282 32)) (_ bv0 32)))} is VALID [2018-11-23 11:41:40,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {1252#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967281 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967280 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1248#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967281 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967282 32)) (_ bv0 32))) (= (bvadd main_~res~0 (_ bv15 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:42,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {1256#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967280 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv17 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1252#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967281 32)) (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv4294967280 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967280 32)) (_ bv0 32)))} is UNKNOWN [2018-11-23 11:41:42,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {1260#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967279 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967278 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv18 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1256#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967280 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv17 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:42,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {1264#(or (= (bvadd main_~a~0 main_~b~0 (_ bv4294967277 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967277 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967278 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1260#(or (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967279 32)) (_ bv0 32))) (bvsgt (bvadd main_~cnt~0 (_ bv4294967278 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv18 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-23 11:41:43,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {1268#(or (= (bvadd main_~res~0 (_ bv20 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967276 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967277 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1264#(or (= (bvadd main_~a~0 main_~b~0 (_ bv4294967277 32)) main_~res~0) (bvsgt (bvadd main_~cnt~0 (_ bv4294967277 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967278 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:43,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {1272#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967275 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv21 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967276 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1268#(or (= (bvadd main_~res~0 (_ bv20 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967276 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967277 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:43,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {1276#(or (= (bvadd main_~res~0 (_ bv22 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967274 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967275 32)) (_ bv0 32))))} assume !!~bvsgt32(~cnt~0, 0bv32);~cnt~0 := ~bvsub32(~cnt~0, 1bv32);~res~0 := ~bvadd32(1bv32, ~res~0); {1272#(or (bvsgt (bvadd main_~cnt~0 (_ bv4294967275 32)) (_ bv0 32)) (= (bvadd main_~res~0 (_ bv21 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967276 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:43,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {1042#true} assume !!(~bvsle32(0bv32, ~b~0) && ~bvsle32(~b~0, 1000000bv32));~res~0 := ~a~0;~cnt~0 := ~b~0; {1276#(or (= (bvadd main_~res~0 (_ bv22 32)) (bvadd main_~a~0 main_~b~0)) (bvsgt (bvadd main_~cnt~0 (_ bv4294967274 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~cnt~0 (_ bv4294967275 32)) (_ bv0 32))))} is VALID [2018-11-23 11:41:43,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {1042#true} assume !!~bvsle32(~a~0, 1000000bv32); {1042#true} is VALID [2018-11-23 11:41:43,715 INFO L273 TraceCheckUtils]: 4: Hoare triple {1042#true} ~a~0 := #t~nondet1;havoc #t~nondet1;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {1042#true} is VALID [2018-11-23 11:41:43,715 INFO L256 TraceCheckUtils]: 3: Hoare triple {1042#true} call #t~ret3 := main(); {1042#true} is VALID [2018-11-23 11:41:43,715 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1042#true} {1042#true} #40#return; {1042#true} is VALID [2018-11-23 11:41:43,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {1042#true} assume true; {1042#true} is VALID [2018-11-23 11:41:43,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2018-11-23 11:41:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:43,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:41:43,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2018-11-23 11:41:43,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 34 [2018-11-23 11:41:43,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:43,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 11:41:52,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:52,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 11:41:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 11:41:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2306, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:41:52,190 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 55 states. [2018-11-23 11:42:52,767 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 183 [2018-11-23 11:42:59,176 WARN L180 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 182 DAG size of output: 121