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/loops/count_up_down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:56,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:56,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:56,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:56,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:56,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:56,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:56,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:56,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:56,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:56,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:56,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:56,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:56,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:56,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:56,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:56,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:56,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:56,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:56,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:56,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:56,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:56,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:56,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:56,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:56,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:56,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:56,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:56,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:56,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:56,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:56,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:56,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:56,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:56,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:56,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:56,209 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:24:56,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:56,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:56,243 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:56,244 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:56,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:56,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:56,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:56,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:56,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:56,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:56,247 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:56,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:56,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:56,249 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:56,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:56,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:56,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:56,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:56,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:56,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:56,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:56,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:56,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:56,251 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:56,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:56,252 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:56,252 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:56,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:56,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:56,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:56,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:56,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:56,321 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:56,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-23 11:24:56,381 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03e8593d/1bf683ce7df9400f9c731fef66acbe59/FLAG050219b95 [2018-11-23 11:24:56,833 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:56,834 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-23 11:24:56,841 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03e8593d/1bf683ce7df9400f9c731fef66acbe59/FLAG050219b95 [2018-11-23 11:24:57,167 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03e8593d/1bf683ce7df9400f9c731fef66acbe59 [2018-11-23 11:24:57,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:57,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:57,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:57,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:57,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:57,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347fad3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57, skipping insertion in model container [2018-11-23 11:24:57,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:57,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:57,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:57,470 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:57,488 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:57,505 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:57,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57 WrapperNode [2018-11-23 11:24:57,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:57,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:57,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:57,507 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:57,517 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:24:57" (1/1) ... [2018-11-23 11:24:57,523 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:24:57" (1/1) ... [2018-11-23 11:24:57,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:57,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:57,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:57,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:57,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (1/1) ... [2018-11-23 11:24:57,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:57,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:57,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:57,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:57,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (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:24:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:57,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:57,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:58,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:58,111 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:24:58,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:58 BoogieIcfgContainer [2018-11-23 11:24:58,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:58,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:58,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:58,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:57" (1/3) ... [2018-11-23 11:24:58,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48208fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:58, skipping insertion in model container [2018-11-23 11:24:58,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:57" (2/3) ... [2018-11-23 11:24:58,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48208fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:58, skipping insertion in model container [2018-11-23 11:24:58,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:58" (3/3) ... [2018-11-23 11:24:58,121 INFO L112 eAbstractionObserver]: Analyzing ICFG count_up_down_true-unreach-call_true-termination.i [2018-11-23 11:24:58,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:58,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:58,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:58,195 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:58,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:58,196 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:58,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:58,197 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:58,197 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:58,197 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:58,197 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:58,197 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:24:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:58,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:58,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:58,226 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:58,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:24:58,237 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:58,237 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:24:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:58,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:58,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:24:58,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:24:58,632 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:24:58,632 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret3 := main(); {20#true} is VALID [2018-11-23 11:24:58,640 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {37#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:58,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {41#(and (not (bvugt main_~n~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:58,652 INFO L256 TraceCheckUtils]: 6: Hoare triple {41#(and (not (bvugt main_~n~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:58,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:58,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:24:58,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:24:58,682 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:24:58,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:58,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:24:58,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 11:24:58,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:58,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:24:58,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:58,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:24:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:24:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:58,809 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2018-11-23 11:24:59,072 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:24:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:59,552 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:24:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:24:59,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 11:24:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 11:24:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 11:24:59,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2018-11-23 11:24:59,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:59,739 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:24:59,740 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:24:59,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:24:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:24:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:24:59,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:59,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:59,810 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:59,810 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:59,813 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:24:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:59,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:59,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:59,814 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:59,814 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:59,817 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:24:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:59,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:59,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:59,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:59,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:24:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:24:59,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:24:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:59,822 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:24:59,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:24:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:24:59,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:59,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:59,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:59,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:24:59,825 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:59,825 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:24:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:59,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:00,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 11:25:00,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 11:25:00,389 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #31#return; {151#true} is VALID [2018-11-23 11:25:00,389 INFO L256 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret3 := main(); {151#true} is VALID [2018-11-23 11:25:00,390 INFO L273 TraceCheckUtils]: 4: Hoare triple {151#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {168#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:00,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {172#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:25:00,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {172#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} assume !~bvugt32(~x~0, 0bv32); {176#(and (not (bvugt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:25:00,406 INFO L256 TraceCheckUtils]: 7: Hoare triple {176#(and (not (bvugt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:00,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:00,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {152#false} is VALID [2018-11-23 11:25:00,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 11:25:00,411 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:25:00,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:01,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 11:25:01,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {152#false} is VALID [2018-11-23 11:25:01,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {194#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:01,086 INFO L256 TraceCheckUtils]: 7: Hoare triple {202#(= main_~n~0 main_~y~0)} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {198#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:01,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {202#(= main_~n~0 main_~y~0)} is VALID [2018-11-23 11:25:01,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {206#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:01,089 INFO L273 TraceCheckUtils]: 4: Hoare triple {151#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {210#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:25:01,089 INFO L256 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret3 := main(); {151#true} is VALID [2018-11-23 11:25:01,090 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #31#return; {151#true} is VALID [2018-11-23 11:25:01,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 11:25:01,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 11:25:01,092 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:25:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:01,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:25:01,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-11-23 11:25:01,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:01,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:25:01,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:25:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:25:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:01,145 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-11-23 11:25:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:01,841 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 11:25:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:25:01,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-11-23 11:25:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-23 11:25:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-23 11:25:01,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-23 11:25:01,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:01,902 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:25:01,902 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:25:01,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:25:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:25:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:25:01,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:01,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:25:01,922 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:25:01,922 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:25:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:01,924 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:25:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:25:01,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:01,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:01,925 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:25:01,925 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:25:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:01,927 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:25:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:25:01,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:01,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:01,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:01,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:25:01,930 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:25:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:25:01,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:25:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:25:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:25:01,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:01,931 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:01,932 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:01,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:25:01,932 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:01,933 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:25:01,950 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:25:01,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:25:01,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:01,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:02,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 11:25:02,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 11:25:02,294 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #31#return; {327#true} is VALID [2018-11-23 11:25:02,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {327#true} call #t~ret3 := main(); {327#true} is VALID [2018-11-23 11:25:02,295 INFO L273 TraceCheckUtils]: 4: Hoare triple {327#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {344#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:02,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {348#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:25:02,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {348#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {352#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:25:02,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {352#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {356#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} is VALID [2018-11-23 11:25:02,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {356#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {360#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} is VALID [2018-11-23 11:25:02,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {360#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} assume !~bvugt32(~x~0, 0bv32); {364#(and (not (bvugt (bvadd main_~n~0 (_ bv4294967292 32)) (_ bv0 32))) (= (_ bv4 32) main_~y~0))} is VALID [2018-11-23 11:25:02,370 INFO L256 TraceCheckUtils]: 10: Hoare triple {364#(and (not (bvugt (bvadd main_~n~0 (_ bv4294967292 32)) (_ bv0 32))) (= (_ bv4 32) main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {368#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:02,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {368#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {372#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:02,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {372#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 11:25:02,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 11:25:02,373 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:25:02,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:02,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 11:25:02,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 11:25:02,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {382#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:02,950 INFO L256 TraceCheckUtils]: 10: Hoare triple {390#(= main_~n~0 main_~y~0)} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {386#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:02,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {394#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {390#(= main_~n~0 main_~y~0)} is VALID [2018-11-23 11:25:02,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {394#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:02,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {402#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {398#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:25:03,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {406#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {402#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} is VALID [2018-11-23 11:25:03,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {410#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {406#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {327#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {410#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:03,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {327#true} call #t~ret3 := main(); {327#true} is VALID [2018-11-23 11:25:03,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #31#return; {327#true} is VALID [2018-11-23 11:25:03,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 11:25:03,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 11:25:03,045 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:25:03,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:03,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:25:03,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-11-23 11:25:03,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:03,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:25:03,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:03,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:25:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:25:03,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:25:03,251 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 18 states. [2018-11-23 11:25:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:04,577 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:25:04,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:25:04,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-11-23 11:25:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:25:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-11-23 11:25:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:25:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-11-23 11:25:04,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 32 transitions. [2018-11-23 11:25:05,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:05,023 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:25:05,024 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:25:05,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:25:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:25:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:25:05,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:05,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:25:05,095 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:25:05,095 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:25:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:05,098 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:25:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:25:05,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:05,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:05,099 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:25:05,099 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:25:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:05,101 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:25:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:25:05,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:05,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:05,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:05,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:25:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:25:05,104 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:25:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:05,105 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:25:05,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:25:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:25:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:25:05,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:05,106 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:05,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 3 times [2018-11-23 11:25:05,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:05,108 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:25:05,124 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:25:05,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:25:05,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:05,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:05,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-23 11:25:05,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-23 11:25:05,853 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #31#return; {571#true} is VALID [2018-11-23 11:25:05,854 INFO L256 TraceCheckUtils]: 3: Hoare triple {571#true} call #t~ret3 := main(); {571#true} is VALID [2018-11-23 11:25:05,856 INFO L273 TraceCheckUtils]: 4: Hoare triple {571#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {588#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {588#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {592#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:25:05,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {592#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {596#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:25:05,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {596#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {600#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} is VALID [2018-11-23 11:25:05,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {600#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {604#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} is VALID [2018-11-23 11:25:05,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {608#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} is VALID [2018-11-23 11:25:05,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {612#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} is VALID [2018-11-23 11:25:06,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {612#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {616#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} is VALID [2018-11-23 11:25:06,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {616#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {620#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:25:06,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {620#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {624#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} is VALID [2018-11-23 11:25:06,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {624#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {628#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} is VALID [2018-11-23 11:25:06,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} assume !~bvugt32(~x~0, 0bv32); {632#(and (= (_ bv10 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967286 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:06,080 INFO L256 TraceCheckUtils]: 16: Hoare triple {632#(and (= (_ bv10 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967286 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {636#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:06,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {636#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {640#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:06,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {640#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {572#false} is VALID [2018-11-23 11:25:06,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-23 11:25:06,083 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:25:06,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:07,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-23 11:25:07,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {650#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {572#false} is VALID [2018-11-23 11:25:07,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {654#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {650#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:07,820 INFO L256 TraceCheckUtils]: 16: Hoare triple {658#(= main_~n~0 main_~y~0)} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {654#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:07,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {658#(= main_~n~0 main_~y~0)} is VALID [2018-11-23 11:25:07,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {666#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {662#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:07,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {670#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {666#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:25:07,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {674#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {670#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} is VALID [2018-11-23 11:25:07,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {674#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:07,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {678#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:07,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {686#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {682#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:07,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {690#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {686#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:07,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {690#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:08,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {698#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {694#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} is VALID [2018-11-23 11:25:08,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {698#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} is VALID [2018-11-23 11:25:08,036 INFO L273 TraceCheckUtils]: 4: Hoare triple {571#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {702#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:08,036 INFO L256 TraceCheckUtils]: 3: Hoare triple {571#true} call #t~ret3 := main(); {571#true} is VALID [2018-11-23 11:25:08,036 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #31#return; {571#true} is VALID [2018-11-23 11:25:08,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-23 11:25:08,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-23 11:25:08,039 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:25:08,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:25:08,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 20 [2018-11-23 11:25:08,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:08,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:25:08,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:08,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:25:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:25:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:25:08,494 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 30 states. [2018-11-23 11:25:10,306 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:25:10,739 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2018-11-23 11:25:11,119 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:25:11,667 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:25:11,953 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:25:13,655 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:25:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:13,754 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-23 11:25:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:25:13,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 20 [2018-11-23 11:25:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:25:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2018-11-23 11:25:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:25:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2018-11-23 11:25:13,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 50 transitions. [2018-11-23 11:25:16,519 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:25:16,521 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:25:16,521 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:25:16,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:25:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:25:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:25:16,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:16,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:25:16,834 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:25:16,834 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:25:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,838 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:25:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:25:16,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,839 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:25:16,839 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:25:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:16,841 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:25:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:25:16,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:16,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:16,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:16,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:25:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:25:16,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:25:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:16,845 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:25:16,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:25:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:25:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:25:16,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:16,846 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:16,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:16,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 4 times [2018-11-23 11:25:16,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:16,848 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:25:16,864 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:25:16,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:25:16,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:25:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:16,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:18,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {947#true} call ULTIMATE.init(); {947#true} is VALID [2018-11-23 11:25:18,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {947#true} assume true; {947#true} is VALID [2018-11-23 11:25:18,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {947#true} {947#true} #31#return; {947#true} is VALID [2018-11-23 11:25:18,126 INFO L256 TraceCheckUtils]: 3: Hoare triple {947#true} call #t~ret3 := main(); {947#true} is VALID [2018-11-23 11:25:18,127 INFO L273 TraceCheckUtils]: 4: Hoare triple {947#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {964#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:18,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {968#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:25:18,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {968#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {972#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {972#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {976#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} is VALID [2018-11-23 11:25:18,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {976#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {980#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} is VALID [2018-11-23 11:25:18,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {984#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {984#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {988#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} is VALID [2018-11-23 11:25:18,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {988#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {992#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {992#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {996#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {996#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1000#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} is VALID [2018-11-23 11:25:18,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {1000#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1004#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} is VALID [2018-11-23 11:25:18,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {1004#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1008#(and (= (_ bv11 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {1008#(and (= (_ bv11 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1012#(and (= (bvadd main_~x~0 (_ bv12 32)) main_~n~0) (= (_ bv12 32) main_~y~0))} is VALID [2018-11-23 11:25:18,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {1012#(and (= (bvadd main_~x~0 (_ bv12 32)) main_~n~0) (= (_ bv12 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1016#(and (= (bvadd main_~x~0 (_ bv13 32)) main_~n~0) (= (_ bv13 32) main_~y~0))} is VALID [2018-11-23 11:25:18,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {1016#(and (= (bvadd main_~x~0 (_ bv13 32)) main_~n~0) (= (_ bv13 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1020#(and (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~x~0) (= (_ bv14 32) main_~y~0))} is VALID [2018-11-23 11:25:18,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {1020#(and (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~x~0) (= (_ bv14 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1024#(and (= (_ bv15 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {1024#(and (= (_ bv15 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1028#(and (= (_ bv16 32) main_~y~0) (= (bvadd main_~x~0 (_ bv16 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {1028#(and (= (_ bv16 32) main_~y~0) (= (bvadd main_~x~0 (_ bv16 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1032#(and (= (_ bv17 32) main_~y~0) (= (bvadd main_~x~0 (_ bv17 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {1032#(and (= (_ bv17 32) main_~y~0) (= (bvadd main_~x~0 (_ bv17 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1036#(and (= (bvadd main_~n~0 (_ bv4294967278 32)) main_~x~0) (= (_ bv18 32) main_~y~0))} is VALID [2018-11-23 11:25:18,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {1036#(and (= (bvadd main_~n~0 (_ bv4294967278 32)) main_~x~0) (= (_ bv18 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1040#(and (= (_ bv19 32) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {1040#(and (= (_ bv19 32) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1044#(and (= (_ bv20 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967276 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {1044#(and (= (_ bv20 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967276 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1048#(and (= (_ bv21 32) main_~y~0) (= (bvadd main_~x~0 (_ bv21 32)) main_~n~0))} is VALID [2018-11-23 11:25:18,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {1048#(and (= (_ bv21 32) main_~y~0) (= (bvadd main_~x~0 (_ bv21 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1052#(and (= (_ bv22 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967274 32)) main_~x~0))} is VALID [2018-11-23 11:25:18,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {1052#(and (= (_ bv22 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967274 32)) main_~x~0))} assume !~bvugt32(~x~0, 0bv32); {1056#(and (= (_ bv22 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967274 32)) (_ bv0 32))))} is VALID [2018-11-23 11:25:18,600 INFO L256 TraceCheckUtils]: 28: Hoare triple {1056#(and (= (_ bv22 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967274 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {1060#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:18,601 INFO L273 TraceCheckUtils]: 29: Hoare triple {1060#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1064#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:18,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {1064#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {948#false} is VALID [2018-11-23 11:25:18,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {948#false} assume !false; {948#false} is VALID [2018-11-23 11:25:18,605 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:25:18,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:24,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {948#false} assume !false; {948#false} is VALID [2018-11-23 11:25:24,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {1074#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {948#false} is VALID [2018-11-23 11:25:24,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {1078#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1074#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:24,145 INFO L256 TraceCheckUtils]: 28: Hoare triple {1082#(= main_~n~0 main_~y~0)} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {1078#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:24,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {1086#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {1082#(= main_~n~0 main_~y~0)} is VALID [2018-11-23 11:25:24,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1086#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:24,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {1094#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1090#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {1098#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1094#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {1102#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1098#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {1106#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1102#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {1110#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1106#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {1114#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1110#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {1118#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1114#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {1122#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1118#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {1126#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1122#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {1130#(or (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1126#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {1134#(or (= (bvadd main_~n~0 (_ bv4294967284 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1130#(or (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {1138#(or (bvugt (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967283 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1134#(or (= (bvadd main_~n~0 (_ bv4294967284 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {1142#(or (bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1138#(or (bvugt (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967283 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {1146#(or (bvugt (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1142#(or (bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {1150#(or (= (bvadd main_~n~0 (_ bv4294967280 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1146#(or (bvugt (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {1154#(or (bvugt (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967279 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1150#(or (= (bvadd main_~n~0 (_ bv4294967280 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {1158#(or (= (bvadd main_~y~0 (_ bv18 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1154#(or (bvugt (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967279 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {1162#(or (bvugt (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967277 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1158#(or (= (bvadd main_~y~0 (_ bv18 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {1166#(or (= (bvadd main_~y~0 (_ bv20 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1162#(or (bvugt (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967277 32)) main_~y~0))} is VALID [2018-11-23 11:25:24,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#(or (= (bvadd main_~n~0 (_ bv4294967275 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1166#(or (= (bvadd main_~y~0 (_ bv20 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {1174#(or (= (bvadd main_~y~0 (_ bv22 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1170#(or (= (bvadd main_~n~0 (_ bv4294967275 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,669 INFO L273 TraceCheckUtils]: 4: Hoare triple {947#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {1174#(or (= (bvadd main_~y~0 (_ bv22 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:24,669 INFO L256 TraceCheckUtils]: 3: Hoare triple {947#true} call #t~ret3 := main(); {947#true} is VALID [2018-11-23 11:25:24,669 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {947#true} {947#true} #31#return; {947#true} is VALID [2018-11-23 11:25:24,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {947#true} assume true; {947#true} is VALID [2018-11-23 11:25:24,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {947#true} call ULTIMATE.init(); {947#true} is VALID [2018-11-23 11:25:24,674 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:25:24,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:24,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:25:24,677 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 32 [2018-11-23 11:25:24,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:24,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:25:25,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:25,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:25:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:25:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=2223, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:25:25,610 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 54 states. [2018-11-23 11:25:31,696 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-23 11:25:32,135 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 72 [2018-11-23 11:25:33,358 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-23 11:25:34,739 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-23 11:25:35,805 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-23 11:25:36,844 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-23 11:25:37,796 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-23 11:25:38,816 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-23 11:25:39,746 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 11:25:40,593 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-23 11:25:41,397 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 11:25:42,204 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 11:25:42,908 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 11:25:43,575 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:25:44,174 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:25:44,682 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:25:45,213 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:25:48,452 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2018-11-23 11:25:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:48,691 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-11-23 11:25:48,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 11:25:48,691 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 32 [2018-11-23 11:25:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:25:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2018-11-23 11:25:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:25:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2018-11-23 11:25:48,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 86 transitions. [2018-11-23 11:26:11,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 80 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:11,149 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:26:11,149 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:26:11,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1850, Invalid=4470, Unknown=0, NotChecked=0, Total=6320 [2018-11-23 11:26:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:26:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:26:11,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:11,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:11,593 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:11,594 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:11,598 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:11,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:11,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:11,599 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:11,599 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:11,602 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:11,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:11,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:11,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:11,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:26:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:26:11,606 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:26:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:11,606 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:26:11,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:26:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:26:11,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:11,608 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:11,609 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:11,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 5 times [2018-11-23 11:26:11,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:11,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:11,639 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:26:15,177 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:26:15,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:15,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:19,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2018-11-23 11:26:19,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {1587#true} assume true; {1587#true} is VALID [2018-11-23 11:26:19,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1587#true} {1587#true} #31#return; {1587#true} is VALID [2018-11-23 11:26:19,069 INFO L256 TraceCheckUtils]: 3: Hoare triple {1587#true} call #t~ret3 := main(); {1587#true} is VALID [2018-11-23 11:26:19,070 INFO L273 TraceCheckUtils]: 4: Hoare triple {1587#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {1604#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:19,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {1604#(and (= main_~n~0 main_~x~0) (= main_~y~0 (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1608#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} is VALID [2018-11-23 11:26:19,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {1608#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~x~0) (= (_ bv1 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1612#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {1612#(and (= (_ bv2 32) main_~y~0) (= (bvadd main_~x~0 (_ bv2 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1616#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} is VALID [2018-11-23 11:26:19,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {1616#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~x~0) (= (_ bv3 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1620#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} is VALID [2018-11-23 11:26:19,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {1620#(and (= (bvadd main_~x~0 (_ bv4 32)) main_~n~0) (= (_ bv4 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1624#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {1624#(and (= (_ bv5 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1628#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} is VALID [2018-11-23 11:26:19,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {1628#(and (= (bvadd main_~x~0 (_ bv6 32)) main_~n~0) (= (_ bv6 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1632#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1632#(and (= (_ bv7 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1636#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {1636#(and (= (_ bv8 32) main_~y~0) (= (bvadd main_~x~0 (_ bv8 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1640#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} is VALID [2018-11-23 11:26:19,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {1640#(and (= (bvadd main_~x~0 (_ bv9 32)) main_~n~0) (= (_ bv9 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1644#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} is VALID [2018-11-23 11:26:19,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {1644#(and (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~x~0) (= (_ bv10 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1648#(and (= (_ bv11 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {1648#(and (= (_ bv11 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1652#(and (= (bvadd main_~x~0 (_ bv12 32)) main_~n~0) (= (_ bv12 32) main_~y~0))} is VALID [2018-11-23 11:26:19,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {1652#(and (= (bvadd main_~x~0 (_ bv12 32)) main_~n~0) (= (_ bv12 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1656#(and (= (bvadd main_~x~0 (_ bv13 32)) main_~n~0) (= (_ bv13 32) main_~y~0))} is VALID [2018-11-23 11:26:19,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1656#(and (= (bvadd main_~x~0 (_ bv13 32)) main_~n~0) (= (_ bv13 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1660#(and (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~x~0) (= (_ bv14 32) main_~y~0))} is VALID [2018-11-23 11:26:19,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {1660#(and (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~x~0) (= (_ bv14 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1664#(and (= (_ bv15 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {1664#(and (= (_ bv15 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1668#(and (= (_ bv16 32) main_~y~0) (= (bvadd main_~x~0 (_ bv16 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {1668#(and (= (_ bv16 32) main_~y~0) (= (bvadd main_~x~0 (_ bv16 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1672#(and (= (_ bv17 32) main_~y~0) (= (bvadd main_~x~0 (_ bv17 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {1672#(and (= (_ bv17 32) main_~y~0) (= (bvadd main_~x~0 (_ bv17 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1676#(and (= (bvadd main_~n~0 (_ bv4294967278 32)) main_~x~0) (= (_ bv18 32) main_~y~0))} is VALID [2018-11-23 11:26:19,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {1676#(and (= (bvadd main_~n~0 (_ bv4294967278 32)) main_~x~0) (= (_ bv18 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1680#(and (= (_ bv19 32) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {1680#(and (= (_ bv19 32) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1684#(and (= (_ bv20 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967276 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {1684#(and (= (_ bv20 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967276 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1688#(and (= (_ bv21 32) main_~y~0) (= (bvadd main_~x~0 (_ bv21 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#(and (= (_ bv21 32) main_~y~0) (= (bvadd main_~x~0 (_ bv21 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1692#(and (= (_ bv22 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967274 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {1692#(and (= (_ bv22 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967274 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1696#(and (= (_ bv23 32) main_~y~0) (= (bvadd main_~x~0 (_ bv23 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {1696#(and (= (_ bv23 32) main_~y~0) (= (bvadd main_~x~0 (_ bv23 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1700#(and (= (_ bv24 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967272 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {1700#(and (= (_ bv24 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967272 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1704#(and (= (_ bv25 32) main_~y~0) (= (bvadd main_~x~0 (_ bv25 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {1704#(and (= (_ bv25 32) main_~y~0) (= (bvadd main_~x~0 (_ bv25 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1708#(and (= (bvadd main_~n~0 (_ bv4294967270 32)) main_~x~0) (= (_ bv26 32) main_~y~0))} is VALID [2018-11-23 11:26:19,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {1708#(and (= (bvadd main_~n~0 (_ bv4294967270 32)) main_~x~0) (= (_ bv26 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1712#(and (= (_ bv27 32) main_~y~0) (= (bvadd main_~x~0 (_ bv27 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {1712#(and (= (_ bv27 32) main_~y~0) (= (bvadd main_~x~0 (_ bv27 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1716#(and (= (_ bv28 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967268 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,745 INFO L273 TraceCheckUtils]: 33: Hoare triple {1716#(and (= (_ bv28 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967268 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1720#(and (= (bvadd main_~n~0 (_ bv4294967267 32)) main_~x~0) (= (_ bv29 32) main_~y~0))} is VALID [2018-11-23 11:26:19,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {1720#(and (= (bvadd main_~n~0 (_ bv4294967267 32)) main_~x~0) (= (_ bv29 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1724#(and (= (bvadd main_~x~0 (_ bv30 32)) main_~n~0) (= (_ bv30 32) main_~y~0))} is VALID [2018-11-23 11:26:19,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {1724#(and (= (bvadd main_~x~0 (_ bv30 32)) main_~n~0) (= (_ bv30 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1728#(and (= (bvadd main_~n~0 (_ bv4294967265 32)) main_~x~0) (= (_ bv31 32) main_~y~0))} is VALID [2018-11-23 11:26:19,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {1728#(and (= (bvadd main_~n~0 (_ bv4294967265 32)) main_~x~0) (= (_ bv31 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1732#(and (= (_ bv32 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967264 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {1732#(and (= (_ bv32 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967264 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1736#(and (= (bvadd main_~x~0 (_ bv33 32)) main_~n~0) (= (_ bv33 32) main_~y~0))} is VALID [2018-11-23 11:26:19,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {1736#(and (= (bvadd main_~x~0 (_ bv33 32)) main_~n~0) (= (_ bv33 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1740#(and (= (_ bv34 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967262 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {1740#(and (= (_ bv34 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967262 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1744#(and (= (_ bv35 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967261 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {1744#(and (= (_ bv35 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967261 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1748#(and (= (_ bv36 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967260 32)) main_~x~0))} is VALID [2018-11-23 11:26:19,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#(and (= (_ bv36 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967260 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1752#(and (= (bvadd main_~x~0 (_ bv37 32)) main_~n~0) (= (_ bv37 32) main_~y~0))} is VALID [2018-11-23 11:26:19,949 INFO L273 TraceCheckUtils]: 42: Hoare triple {1752#(and (= (bvadd main_~x~0 (_ bv37 32)) main_~n~0) (= (_ bv37 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1756#(and (= (bvadd main_~n~0 (_ bv4294967258 32)) main_~x~0) (= (_ bv38 32) main_~y~0))} is VALID [2018-11-23 11:26:19,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {1756#(and (= (bvadd main_~n~0 (_ bv4294967258 32)) main_~x~0) (= (_ bv38 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1760#(and (= (_ bv39 32) main_~y~0) (= (bvadd main_~x~0 (_ bv39 32)) main_~n~0))} is VALID [2018-11-23 11:26:19,999 INFO L273 TraceCheckUtils]: 44: Hoare triple {1760#(and (= (_ bv39 32) main_~y~0) (= (bvadd main_~x~0 (_ bv39 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1764#(and (= (_ bv40 32) main_~y~0) (= (bvadd main_~x~0 (_ bv40 32)) main_~n~0))} is VALID [2018-11-23 11:26:20,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {1764#(and (= (_ bv40 32) main_~y~0) (= (bvadd main_~x~0 (_ bv40 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1768#(and (= (bvadd main_~n~0 (_ bv4294967255 32)) main_~x~0) (= (_ bv41 32) main_~y~0))} is VALID [2018-11-23 11:26:20,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {1768#(and (= (bvadd main_~n~0 (_ bv4294967255 32)) main_~x~0) (= (_ bv41 32) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1772#(and (= (_ bv42 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967254 32)) main_~x~0))} is VALID [2018-11-23 11:26:20,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {1772#(and (= (_ bv42 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967254 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1776#(and (= (_ bv43 32) main_~y~0) (= (bvadd main_~x~0 (_ bv43 32)) main_~n~0))} is VALID [2018-11-23 11:26:20,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {1776#(and (= (_ bv43 32) main_~y~0) (= (bvadd main_~x~0 (_ bv43 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1780#(and (= (_ bv44 32) main_~y~0) (= (bvadd main_~x~0 (_ bv44 32)) main_~n~0))} is VALID [2018-11-23 11:26:20,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {1780#(and (= (_ bv44 32) main_~y~0) (= (bvadd main_~x~0 (_ bv44 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1784#(and (= (_ bv45 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967251 32)) main_~x~0))} is VALID [2018-11-23 11:26:20,277 INFO L273 TraceCheckUtils]: 50: Hoare triple {1784#(and (= (_ bv45 32) main_~y~0) (= (bvadd main_~n~0 (_ bv4294967251 32)) main_~x~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1788#(and (= (bvadd main_~x~0 (_ bv46 32)) main_~n~0) (= (_ bv46 32) main_~y~0))} is VALID [2018-11-23 11:26:20,278 INFO L273 TraceCheckUtils]: 51: Hoare triple {1788#(and (= (bvadd main_~x~0 (_ bv46 32)) main_~n~0) (= (_ bv46 32) main_~y~0))} assume !~bvugt32(~x~0, 0bv32); {1792#(and (= (_ bv46 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967250 32)) (_ bv0 32))))} is VALID [2018-11-23 11:26:20,279 INFO L256 TraceCheckUtils]: 52: Hoare triple {1792#(and (= (_ bv46 32) main_~y~0) (not (bvugt (bvadd main_~n~0 (_ bv4294967250 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {1796#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:20,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {1796#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1800#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:20,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {1800#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1588#false} is VALID [2018-11-23 11:26:20,280 INFO L273 TraceCheckUtils]: 55: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2018-11-23 11:26:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:20,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:32,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2018-11-23 11:26:32,942 INFO L273 TraceCheckUtils]: 54: Hoare triple {1810#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1588#false} is VALID [2018-11-23 11:26:32,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {1814#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1810#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:32,944 INFO L256 TraceCheckUtils]: 52: Hoare triple {1818#(= main_~n~0 main_~y~0)} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1bv32 else 0bv32)); {1814#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:32,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {1822#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} assume !~bvugt32(~x~0, 0bv32); {1818#(= main_~n~0 main_~y~0)} is VALID [2018-11-23 11:26:32,945 INFO L273 TraceCheckUtils]: 50: Hoare triple {1826#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1822#(or (= main_~n~0 main_~y~0) (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:32,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {1830#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1826#(or (bvugt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:26:32,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {1834#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1830#(or (bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967294 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,029 INFO L273 TraceCheckUtils]: 47: Hoare triple {1838#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1834#(or (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,052 INFO L273 TraceCheckUtils]: 46: Hoare triple {1842#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1838#(or (= (bvadd main_~y~0 (_ bv4 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {1846#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1842#(or (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {1850#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1846#(or (= (bvadd main_~n~0 (_ bv4294967290 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {1854#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1850#(or (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {1858#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1854#(or (bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967288 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {1862#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1858#(or (bvugt (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967287 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {1866#(or (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1862#(or (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {1870#(or (= (bvadd main_~n~0 (_ bv4294967284 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1866#(or (= (bvadd main_~n~0 (_ bv4294967285 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {1874#(or (bvugt (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967283 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1870#(or (= (bvadd main_~n~0 (_ bv4294967284 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {1878#(or (bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1874#(or (bvugt (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967283 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {1882#(or (bvugt (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1878#(or (bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967282 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {1886#(or (= (bvadd main_~n~0 (_ bv4294967280 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1882#(or (bvugt (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967281 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {1890#(or (bvugt (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967279 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1886#(or (= (bvadd main_~n~0 (_ bv4294967280 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {1894#(or (= (bvadd main_~y~0 (_ bv18 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1890#(or (bvugt (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967279 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {1898#(or (bvugt (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967277 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1894#(or (= (bvadd main_~y~0 (_ bv18 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {1902#(or (= (bvadd main_~y~0 (_ bv20 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1898#(or (bvugt (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967277 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {1906#(or (= (bvadd main_~n~0 (_ bv4294967275 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1902#(or (= (bvadd main_~y~0 (_ bv20 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {1910#(or (= (bvadd main_~y~0 (_ bv22 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1906#(or (= (bvadd main_~n~0 (_ bv4294967275 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {1914#(or (= (bvadd main_~y~0 (_ bv23 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1910#(or (= (bvadd main_~y~0 (_ bv22 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {1918#(or (bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967272 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1914#(or (= (bvadd main_~y~0 (_ bv23 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {1922#(or (bvugt (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv25 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1918#(or (bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967272 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {1926#(or (bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967270 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1922#(or (bvugt (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv25 32)) main_~n~0))} is VALID [2018-11-23 11:26:33,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {1930#(or (bvugt (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv27 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1926#(or (bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967270 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {1934#(or (= (bvadd main_~n~0 (_ bv4294967268 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1930#(or (bvugt (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv27 32)) main_~n~0))} is VALID [2018-11-23 11:26:33,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {1938#(or (= (bvadd main_~n~0 (_ bv4294967267 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1934#(or (= (bvadd main_~n~0 (_ bv4294967268 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {1942#(or (= (bvadd main_~n~0 (_ bv4294967266 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1938#(or (= (bvadd main_~n~0 (_ bv4294967267 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {1946#(or (= (bvadd main_~n~0 (_ bv4294967265 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1942#(or (= (bvadd main_~n~0 (_ bv4294967266 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {1950#(or (bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967264 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1946#(or (= (bvadd main_~n~0 (_ bv4294967265 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {1954#(or (bvugt (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv33 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1950#(or (bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967264 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {1958#(or (bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967262 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1954#(or (bvugt (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv33 32)) main_~n~0))} is VALID [2018-11-23 11:26:33,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {1962#(or (bvugt (bvadd main_~x~0 (_ bv4294967261 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967261 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1958#(or (bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967262 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {1966#(or (bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967260 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1962#(or (bvugt (bvadd main_~x~0 (_ bv4294967261 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967261 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {1970#(or (= (bvadd main_~n~0 (_ bv4294967259 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1966#(or (bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967260 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {1974#(or (= (bvadd main_~n~0 (_ bv4294967258 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1970#(or (= (bvadd main_~n~0 (_ bv4294967259 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {1978#(or (bvugt (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967257 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1974#(or (= (bvadd main_~n~0 (_ bv4294967258 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:33,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {1982#(or (bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967256 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1978#(or (bvugt (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967257 32)) main_~y~0))} is VALID [2018-11-23 11:26:33,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {1986#(or (bvugt (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967255 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1982#(or (bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967256 32)) main_~y~0))} is VALID [2018-11-23 11:26:34,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1990#(or (= (bvadd main_~n~0 (_ bv4294967254 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1986#(or (bvugt (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967255 32)) main_~y~0))} is VALID [2018-11-23 11:26:34,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {1994#(or (bvugt (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv43 32)) main_~n~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1990#(or (= (bvadd main_~n~0 (_ bv4294967254 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:34,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {1998#(or (= (bvadd main_~y~0 (_ bv44 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1994#(or (bvugt (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv43 32)) main_~n~0))} is VALID [2018-11-23 11:26:34,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {2002#(or (bvugt (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967251 32)) main_~y~0))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1998#(or (= (bvadd main_~y~0 (_ bv44 32)) main_~n~0) (bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:34,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {2006#(or (= (bvadd main_~n~0 (_ bv4294967250 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32)))} assume !!~bvugt32(~x~0, 0bv32);#t~post1 := ~x~0;~x~0 := ~bvsub32(#t~post1, 1bv32);havoc #t~post1;#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2002#(or (bvugt (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967251 32)) main_~y~0))} is VALID [2018-11-23 11:26:34,108 INFO L273 TraceCheckUtils]: 4: Hoare triple {1587#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0bv32; {2006#(or (= (bvadd main_~n~0 (_ bv4294967250 32)) main_~y~0) (bvugt (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:34,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {1587#true} call #t~ret3 := main(); {1587#true} is VALID [2018-11-23 11:26:34,109 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1587#true} {1587#true} #31#return; {1587#true} is VALID [2018-11-23 11:26:34,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {1587#true} assume true; {1587#true} is VALID [2018-11-23 11:26:34,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2018-11-23 11:26:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2018-11-23 11:26:34,123 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 56 [2018-11-23 11:26:34,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:34,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states. [2018-11-23 11:26:36,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-23 11:26:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-23 11:26:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=7887, Unknown=0, NotChecked=0, Total=10302 [2018-11-23 11:26:36,105 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 102 states. [2018-11-23 11:26:58,094 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 294 [2018-11-23 11:26:59,305 WARN L180 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 144 [2018-11-23 11:27:04,147 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 288 [2018-11-23 11:27:09,104 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 282 [2018-11-23 11:27:13,828 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 275 [2018-11-23 11:27:18,489 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 268 [2018-11-23 11:27:23,258 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 262 [2018-11-23 11:27:27,601 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 256 [2018-11-23 11:27:31,793 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 250 [2018-11-23 11:27:36,039 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 244 [2018-11-23 11:27:39,954 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 238 [2018-11-23 11:27:43,675 WARN L180 SmtUtils]: Spent 962.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2018-11-23 11:27:47,479 WARN L180 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2018-11-23 11:27:51,136 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2018-11-23 11:27:54,733 WARN L180 SmtUtils]: Spent 886.00 ms on a formula simplification that was a NOOP. DAG size: 214 [2018-11-23 11:27:58,139 WARN L180 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2018-11-23 11:28:01,471 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2018-11-23 11:28:04,723 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2018-11-23 11:28:07,830 WARN L180 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2018-11-23 11:28:10,742 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-11-23 11:28:13,589 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-11-23 11:28:16,391 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-11-23 11:28:19,102 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-11-23 11:28:21,632 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-11-23 11:28:23,937 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-23 11:28:26,216 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-23 11:28:28,437 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-23 11:28:30,648 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-23 11:28:32,677 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-23 11:28:34,610 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-23 11:28:36,479 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 111