java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:29:11,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:29:11,550 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:29:11,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:29:11,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:29:11,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:29:11,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:29:11,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:29:11,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:29:11,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:29:11,570 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:29:11,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:29:11,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:29:11,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:29:11,574 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:29:11,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:29:11,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:29:11,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:29:11,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:29:11,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:29:11,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:29:11,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:29:11,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:29:11,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:29:11,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:29:11,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:29:11,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:29:11,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:29:11,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:29:11,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:29:11,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:29:11,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:29:11,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:29:11,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:29:11,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:29:11,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:29:11,596 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:29:11,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:29:11,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:29:11,613 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:29:11,613 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:29:11,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:29:11,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:29:11,614 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:29:11,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:29:11,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:29:11,616 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:29:11,616 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:29:11,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:29:11,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:29:11,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:29:11,617 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:29:11,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:29:11,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:29:11,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:29:11,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:29:11,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:29:11,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:29:11,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:29:11,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:29:11,618 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:29:11,619 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:29:11,619 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:29:11,619 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:29:11,619 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:29:11,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:29:11,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:29:11,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:29:11,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:29:11,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:29:11,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-23 11:29:11,769 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ba0c0b9/5c739d3e74404c70bd248d929b92cb8a/FLAG6ce829c13 [2018-11-23 11:29:12,273 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:12,274 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-23 11:29:12,281 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ba0c0b9/5c739d3e74404c70bd248d929b92cb8a/FLAG6ce829c13 [2018-11-23 11:29:12,615 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ba0c0b9/5c739d3e74404c70bd248d929b92cb8a [2018-11-23 11:29:12,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:12,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:12,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:12,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:12,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:12,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:12,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ba15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12, skipping insertion in model container [2018-11-23 11:29:12,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:12,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:12,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:12,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:12,936 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:12,958 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:12,987 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:12,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12 WrapperNode [2018-11-23 11:29:12,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:12,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:12,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:12,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:12,999 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:29:12" (1/1) ... [2018-11-23 11:29:13,007 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:29:12" (1/1) ... [2018-11-23 11:29:13,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:13,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:13,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:13,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:13,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (1/1) ... [2018-11-23 11:29:13,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:13,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:13,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:13,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:13,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (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:29:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:13,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:13,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:13,687 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:13,687 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:29:13,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:13 BoogieIcfgContainer [2018-11-23 11:29:13,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:13,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:13,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:13,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:13,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:12" (1/3) ... [2018-11-23 11:29:13,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc0bf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:13, skipping insertion in model container [2018-11-23 11:29:13,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:12" (2/3) ... [2018-11-23 11:29:13,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc0bf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:13, skipping insertion in model container [2018-11-23 11:29:13,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:13" (3/3) ... [2018-11-23 11:29:13,698 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i [2018-11-23 11:29:13,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:13,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:13,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:13,766 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:13,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:13,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:13,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:13,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:13,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:13,769 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:13,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:13,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 11:29:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:13,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:13,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:13,799 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:13,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 11:29:13,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:13,810 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:29:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:13,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:13,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 11:29:13,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 11:29:13,958 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 11:29:13,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-23 11:29:13,959 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 11:29:13,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 11:29:13,961 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-23 11:29:13,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 11:29:13,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-23 11:29:13,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 11:29:13,965 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:29:13,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:13,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:13,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:29:13,975 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:29:13,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:13,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:29:14,060 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:29:14,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:29:14,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:29:14,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:29:14,071 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 11:29:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:14,171 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:29:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:29:14,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:29:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 11:29:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 11:29:14,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 11:29:14,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:14,532 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:29:14,532 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:29:14,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:29:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:29:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:29:14,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:14,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:14,600 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:14,600 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:14,603 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:29:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:29:14,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:14,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:14,604 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:14,604 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:14,607 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:29:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:29:14,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:14,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:14,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:14,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 11:29:14,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 11:29:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:14,613 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 11:29:14,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:29:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:29:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:14,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:14,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:14,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:14,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 11:29:14,615 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:14,615 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:29:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:14,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:14,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-23 11:29:14,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-23 11:29:14,757 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #37#return; {133#true} is VALID [2018-11-23 11:29:14,757 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret2 := main(); {133#true} is VALID [2018-11-23 11:29:14,758 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:14,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {134#false} is VALID [2018-11-23 11:29:14,763 INFO L256 TraceCheckUtils]: 6: Hoare triple {134#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {134#false} is VALID [2018-11-23 11:29:14,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {134#false} ~cond := #in~cond; {134#false} is VALID [2018-11-23 11:29:14,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#false} assume 0bv32 == ~cond; {134#false} is VALID [2018-11-23 11:29:14,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-23 11:29:14,765 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:29:14,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:14,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:14,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:14,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:14,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:14,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:14,808 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:29:14,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:14,809 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 11:29:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:14,898 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:29:14,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:14,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 11:29:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 11:29:14,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-11-23 11:29:15,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:15,078 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:29:15,078 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:29:15,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:29:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 11:29:15,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:15,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 11:29:15,095 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 11:29:15,096 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 11:29:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:15,098 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:29:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:29:15,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:15,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:15,099 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 11:29:15,099 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 11:29:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:15,101 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:29:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:29:15,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:15,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:15,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:15,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:29:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:29:15,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 11:29:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:15,104 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:29:15,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:29:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:29:15,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:15,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:15,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:15,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 11:29:15,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:15,107 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:29:15,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:15,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:15,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2018-11-23 11:29:15,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {243#true} assume true; {243#true} is VALID [2018-11-23 11:29:15,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} #37#return; {243#true} is VALID [2018-11-23 11:29:15,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {243#true} call #t~ret2 := main(); {243#true} is VALID [2018-11-23 11:29:15,221 INFO L273 TraceCheckUtils]: 4: Hoare triple {243#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {260#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:15,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {260#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {260#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:15,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {267#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:15,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {267#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {244#false} is VALID [2018-11-23 11:29:15,224 INFO L256 TraceCheckUtils]: 8: Hoare triple {244#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {244#false} is VALID [2018-11-23 11:29:15,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {244#false} ~cond := #in~cond; {244#false} is VALID [2018-11-23 11:29:15,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#false} assume 0bv32 == ~cond; {244#false} is VALID [2018-11-23 11:29:15,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {244#false} assume !false; {244#false} is VALID [2018-11-23 11:29:15,227 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:29:15,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:15,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {244#false} assume !false; {244#false} is VALID [2018-11-23 11:29:15,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#false} assume 0bv32 == ~cond; {244#false} is VALID [2018-11-23 11:29:15,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {244#false} ~cond := #in~cond; {244#false} is VALID [2018-11-23 11:29:15,331 INFO L256 TraceCheckUtils]: 8: Hoare triple {244#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {244#false} is VALID [2018-11-23 11:29:15,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {244#false} is VALID [2018-11-23 11:29:15,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {295#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:15,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {299#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:15,347 INFO L273 TraceCheckUtils]: 4: Hoare triple {243#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {299#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:15,347 INFO L256 TraceCheckUtils]: 3: Hoare triple {243#true} call #t~ret2 := main(); {243#true} is VALID [2018-11-23 11:29:15,348 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} #37#return; {243#true} is VALID [2018-11-23 11:29:15,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {243#true} assume true; {243#true} is VALID [2018-11-23 11:29:15,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2018-11-23 11:29:15,350 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:29:15,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:15,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:29:15,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:29:15,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:15,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:29:15,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:15,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:29:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:29:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:29:15,501 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-11-23 11:29:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,095 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 11:29:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:29:16,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:29:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-23 11:29:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-23 11:29:16,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2018-11-23 11:29:16,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:16,172 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:29:16,172 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:29:16,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:29:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:29:16,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:16,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:29:16,200 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:29:16,201 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:29:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,203 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 11:29:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:29:16,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,204 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:29:16,204 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:29:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,207 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 11:29:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:29:16,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:16,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:29:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 11:29:16,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2018-11-23 11:29:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:16,212 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 11:29:16,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:29:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:29:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:29:16,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:16,213 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:16,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:16,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1032562195, now seen corresponding path program 1 times [2018-11-23 11:29:16,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:16,215 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:29:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:16,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:16,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2018-11-23 11:29:16,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2018-11-23 11:29:16,329 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #37#return; {427#true} is VALID [2018-11-23 11:29:16,329 INFO L256 TraceCheckUtils]: 3: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2018-11-23 11:29:16,330 INFO L273 TraceCheckUtils]: 4: Hoare triple {427#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {427#true} is VALID [2018-11-23 11:29:16,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {427#true} assume !!~bvult32(~x~0, 99bv32); {427#true} is VALID [2018-11-23 11:29:16,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {450#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:16,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {450#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:16,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {450#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {428#false} is VALID [2018-11-23 11:29:16,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {428#false} assume !!~bvult32(~x~0, 99bv32); {428#false} is VALID [2018-11-23 11:29:16,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {428#false} is VALID [2018-11-23 11:29:16,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#false} assume !~bvult32(~x~0, 99bv32); {428#false} is VALID [2018-11-23 11:29:16,340 INFO L256 TraceCheckUtils]: 12: Hoare triple {428#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {428#false} is VALID [2018-11-23 11:29:16,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2018-11-23 11:29:16,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {428#false} assume 0bv32 == ~cond; {428#false} is VALID [2018-11-23 11:29:16,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#false} assume !false; {428#false} is VALID [2018-11-23 11:29:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:29:16,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:16,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:16,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:16,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:29:16,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:16,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:16,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:16,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:16,372 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2018-11-23 11:29:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,475 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-23 11:29:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:16,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:29:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:29:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:29:16,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 11:29:16,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:16,548 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:29:16,548 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:29:16,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:29:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 11:29:16,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:16,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 11:29:16,616 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 11:29:16,616 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 11:29:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,619 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 11:29:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 11:29:16,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,620 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 11:29:16,621 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 11:29:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,623 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 11:29:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 11:29:16,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:16,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-23 11:29:16,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2018-11-23 11:29:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:16,627 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 11:29:16,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-23 11:29:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:29:16,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:16,628 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:16,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:16,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 1 times [2018-11-23 11:29:16,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:16,630 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:29:16,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:16,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:16,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2018-11-23 11:29:16,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {617#true} assume true; {617#true} is VALID [2018-11-23 11:29:16,811 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {617#true} {617#true} #37#return; {617#true} is VALID [2018-11-23 11:29:16,812 INFO L256 TraceCheckUtils]: 3: Hoare triple {617#true} call #t~ret2 := main(); {617#true} is VALID [2018-11-23 11:29:16,813 INFO L273 TraceCheckUtils]: 4: Hoare triple {617#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {634#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:16,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {634#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {634#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:16,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {634#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {641#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:16,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {641#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {641#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:16,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {641#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {648#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:16,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {648#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:16,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#(= (_ bv2 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {655#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:16,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {655#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {618#false} is VALID [2018-11-23 11:29:16,823 INFO L256 TraceCheckUtils]: 12: Hoare triple {618#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {618#false} is VALID [2018-11-23 11:29:16,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {618#false} ~cond := #in~cond; {618#false} is VALID [2018-11-23 11:29:16,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {618#false} assume 0bv32 == ~cond; {618#false} is VALID [2018-11-23 11:29:16,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {618#false} assume !false; {618#false} is VALID [2018-11-23 11:29:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:16,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:16,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {618#false} assume !false; {618#false} is VALID [2018-11-23 11:29:16,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {618#false} assume 0bv32 == ~cond; {618#false} is VALID [2018-11-23 11:29:16,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {618#false} ~cond := #in~cond; {618#false} is VALID [2018-11-23 11:29:16,978 INFO L256 TraceCheckUtils]: 12: Hoare triple {618#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {618#false} is VALID [2018-11-23 11:29:16,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {618#false} is VALID [2018-11-23 11:29:16,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {687#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {683#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:16,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {687#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {687#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {694#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {687#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {694#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {694#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {701#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,994 INFO L273 TraceCheckUtils]: 4: Hoare triple {617#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {701#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:16,994 INFO L256 TraceCheckUtils]: 3: Hoare triple {617#true} call #t~ret2 := main(); {617#true} is VALID [2018-11-23 11:29:16,994 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {617#true} {617#true} #37#return; {617#true} is VALID [2018-11-23 11:29:16,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {617#true} assume true; {617#true} is VALID [2018-11-23 11:29:16,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2018-11-23 11:29:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:16,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:16,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:29:16,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:29:16,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:16,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:29:17,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:17,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:29:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:29:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:29:17,042 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 10 states. [2018-11-23 11:29:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:17,705 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 11:29:17,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:29:17,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:29:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:29:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 11:29:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:29:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 11:29:17,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2018-11-23 11:29:17,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:17,781 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:29:17,782 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:29:17,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:29:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:29:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-23 11:29:17,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:17,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2018-11-23 11:29:17,847 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2018-11-23 11:29:17,847 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2018-11-23 11:29:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:17,851 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 11:29:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 11:29:17,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:17,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:17,852 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2018-11-23 11:29:17,852 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2018-11-23 11:29:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:17,854 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 11:29:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 11:29:17,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:17,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:17,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:17,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:29:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:29:17,858 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2018-11-23 11:29:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:17,858 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:29:17,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:29:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:29:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:29:17,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:17,860 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:17,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:17,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 2 times [2018-11-23 11:29:17,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:17,861 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:29:17,878 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:17,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:17,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:17,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:18,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2018-11-23 11:29:18,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {928#true} assume true; {928#true} is VALID [2018-11-23 11:29:18,074 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {928#true} {928#true} #37#return; {928#true} is VALID [2018-11-23 11:29:18,074 INFO L256 TraceCheckUtils]: 3: Hoare triple {928#true} call #t~ret2 := main(); {928#true} is VALID [2018-11-23 11:29:18,075 INFO L273 TraceCheckUtils]: 4: Hoare triple {928#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {945#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:18,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {945#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {945#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:18,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {952#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {952#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {952#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {952#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {959#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {959#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {959#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {959#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {966#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {966#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {966#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {973#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:18,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {973#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {929#false} is VALID [2018-11-23 11:29:18,094 INFO L256 TraceCheckUtils]: 14: Hoare triple {929#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {929#false} is VALID [2018-11-23 11:29:18,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#false} ~cond := #in~cond; {929#false} is VALID [2018-11-23 11:29:18,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {929#false} assume 0bv32 == ~cond; {929#false} is VALID [2018-11-23 11:29:18,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {929#false} assume !false; {929#false} is VALID [2018-11-23 11:29:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:18,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:18,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {929#false} assume !false; {929#false} is VALID [2018-11-23 11:29:18,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {929#false} assume 0bv32 == ~cond; {929#false} is VALID [2018-11-23 11:29:18,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#false} ~cond := #in~cond; {929#false} is VALID [2018-11-23 11:29:18,349 INFO L256 TraceCheckUtils]: 14: Hoare triple {929#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {929#false} is VALID [2018-11-23 11:29:18,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {1001#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {929#false} is VALID [2018-11-23 11:29:18,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {1005#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1001#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:18,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {1005#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1005#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {1012#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1005#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {1012#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1012#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {1019#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1012#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {1019#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1019#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {1026#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1019#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {1026#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1026#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {928#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1026#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:18,382 INFO L256 TraceCheckUtils]: 3: Hoare triple {928#true} call #t~ret2 := main(); {928#true} is VALID [2018-11-23 11:29:18,382 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {928#true} {928#true} #37#return; {928#true} is VALID [2018-11-23 11:29:18,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {928#true} assume true; {928#true} is VALID [2018-11-23 11:29:18,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2018-11-23 11:29:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:29:18,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:29:18,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:18,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:29:18,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:18,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:29:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:29:18,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:18,446 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 12 states. [2018-11-23 11:29:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,399 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2018-11-23 11:29:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:29:19,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:29:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 11:29:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 11:29:19,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2018-11-23 11:29:19,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:19,544 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:29:19,544 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:29:19,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:29:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:29:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2018-11-23 11:29:19,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:19,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 46 states. [2018-11-23 11:29:19,611 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 46 states. [2018-11-23 11:29:19,611 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 46 states. [2018-11-23 11:29:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,615 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 11:29:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-23 11:29:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:19,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:19,617 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 70 states. [2018-11-23 11:29:19,617 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 70 states. [2018-11-23 11:29:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,621 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 11:29:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-23 11:29:19,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:19,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:19,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:19,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:29:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-23 11:29:19,626 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 18 [2018-11-23 11:29:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:19,626 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-23 11:29:19,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:29:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2018-11-23 11:29:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:29:19,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:19,627 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:19,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:19,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 212618007, now seen corresponding path program 2 times [2018-11-23 11:29:19,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:19,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:19,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:19,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:19,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:19,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:19,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {1382#true} call ULTIMATE.init(); {1382#true} is VALID [2018-11-23 11:29:19,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {1382#true} assume true; {1382#true} is VALID [2018-11-23 11:29:19,760 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1382#true} {1382#true} #37#return; {1382#true} is VALID [2018-11-23 11:29:19,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {1382#true} call #t~ret2 := main(); {1382#true} is VALID [2018-11-23 11:29:19,761 INFO L273 TraceCheckUtils]: 4: Hoare triple {1382#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1382#true} is VALID [2018-11-23 11:29:19,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {1382#true} assume !!~bvult32(~x~0, 99bv32); {1382#true} is VALID [2018-11-23 11:29:19,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {1382#true} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1405#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:19,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {1405#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1405#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:19,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {1405#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {1383#false} assume !!~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {1383#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#false} assume !!~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {1383#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {1383#false} assume !!~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {1383#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {1383#false} assume !!~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {1383#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {1383#false} assume !!~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {1383#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1383#false} is VALID [2018-11-23 11:29:19,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {1383#false} assume !~bvult32(~x~0, 99bv32); {1383#false} is VALID [2018-11-23 11:29:19,765 INFO L256 TraceCheckUtils]: 20: Hoare triple {1383#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1383#false} is VALID [2018-11-23 11:29:19,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {1383#false} ~cond := #in~cond; {1383#false} is VALID [2018-11-23 11:29:19,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {1383#false} assume 0bv32 == ~cond; {1383#false} is VALID [2018-11-23 11:29:19,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2018-11-23 11:29:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:29:19,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:19,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:19,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:29:19,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:19,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:19,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:19,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:19,827 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 3 states. [2018-11-23 11:29:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,934 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 11:29:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:19,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:29:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:29:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:29:19,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 11:29:19,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:19,978 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:29:19,979 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:29:19,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:29:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 11:29:20,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:20,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 11:29:20,030 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 11:29:20,030 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 11:29:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:20,034 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:29:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:29:20,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:20,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:20,035 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 11:29:20,035 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 11:29:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:20,037 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:29:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:29:20,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:20,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:20,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:20,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:29:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 11:29:20,041 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 24 [2018-11-23 11:29:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:20,041 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 11:29:20,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:29:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:29:20,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:20,042 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:20,042 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:20,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 2 times [2018-11-23 11:29:20,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:20,044 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:20,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:20,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:20,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:20,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1718#true} is VALID [2018-11-23 11:29:20,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {1718#true} assume true; {1718#true} is VALID [2018-11-23 11:29:20,254 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1718#true} {1718#true} #37#return; {1718#true} is VALID [2018-11-23 11:29:20,254 INFO L256 TraceCheckUtils]: 3: Hoare triple {1718#true} call #t~ret2 := main(); {1718#true} is VALID [2018-11-23 11:29:20,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {1718#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1735#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:20,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1735#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1735#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:20,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1742#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1742#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1742#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {1742#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1749#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:20,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1749#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {1749#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:20,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1749#(= (_ bv2 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1756#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1756#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1756#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {1756#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1763#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:20,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {1763#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {1763#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:20,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {1763#(= (_ bv4 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1770#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {1770#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1770#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {1770#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1777#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:20,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {1777#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {1777#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:20,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {1777#(= (_ bv6 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1784#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {1784#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1784#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1791#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {1791#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {1719#false} is VALID [2018-11-23 11:29:20,270 INFO L256 TraceCheckUtils]: 22: Hoare triple {1719#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1719#false} is VALID [2018-11-23 11:29:20,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {1719#false} ~cond := #in~cond; {1719#false} is VALID [2018-11-23 11:29:20,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {1719#false} assume 0bv32 == ~cond; {1719#false} is VALID [2018-11-23 11:29:20,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2018-11-23 11:29:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:20,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:20,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2018-11-23 11:29:20,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {1719#false} assume 0bv32 == ~cond; {1719#false} is VALID [2018-11-23 11:29:20,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {1719#false} ~cond := #in~cond; {1719#false} is VALID [2018-11-23 11:29:20,847 INFO L256 TraceCheckUtils]: 22: Hoare triple {1719#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1719#false} is VALID [2018-11-23 11:29:20,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {1819#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {1719#false} is VALID [2018-11-23 11:29:20,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {1823#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1819#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:20,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {1823#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1823#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {1830#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1823#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {1830#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1830#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {1837#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1830#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {1837#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1837#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {1844#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1837#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {1844#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1844#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {1851#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1844#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {1851#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1851#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {1858#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1851#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {1858#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1858#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {1865#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1858#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {1865#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1865#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {1872#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1865#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {1872#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1872#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,881 INFO L273 TraceCheckUtils]: 4: Hoare triple {1718#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1872#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:20,881 INFO L256 TraceCheckUtils]: 3: Hoare triple {1718#true} call #t~ret2 := main(); {1718#true} is VALID [2018-11-23 11:29:20,881 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1718#true} {1718#true} #37#return; {1718#true} is VALID [2018-11-23 11:29:20,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {1718#true} assume true; {1718#true} is VALID [2018-11-23 11:29:20,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1718#true} is VALID [2018-11-23 11:29:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:29:20,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 11:29:20,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:20,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:29:21,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:21,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:29:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:29:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:29:21,022 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 20 states. [2018-11-23 11:29:22,989 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-11-23 11:29:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:23,438 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 11:29:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:29:23,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 11:29:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:29:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2018-11-23 11:29:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:29:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2018-11-23 11:29:23,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 71 transitions. [2018-11-23 11:29:23,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:23,599 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:29:23,599 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:29:23,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=278, Invalid=478, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:29:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:29:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 11:29:23,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:23,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 11:29:23,716 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:29:23,716 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:29:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:23,719 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 11:29:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:29:23,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:23,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:23,720 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:29:23,720 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:29:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:23,723 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 11:29:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:29:23,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:23,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:23,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:23,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:29:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 11:29:23,727 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 26 [2018-11-23 11:29:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:23,727 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 11:29:23,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:29:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:29:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:29:23,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:23,728 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:23,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:23,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 3 times [2018-11-23 11:29:23,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:23,752 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:23,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:29:23,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:23,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:24,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {2250#true} call ULTIMATE.init(); {2250#true} is VALID [2018-11-23 11:29:24,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {2250#true} assume true; {2250#true} is VALID [2018-11-23 11:29:24,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2250#true} {2250#true} #37#return; {2250#true} is VALID [2018-11-23 11:29:24,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {2250#true} call #t~ret2 := main(); {2250#true} is VALID [2018-11-23 11:29:24,194 INFO L273 TraceCheckUtils]: 4: Hoare triple {2250#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2267#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:24,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {2267#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2267#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:24,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {2267#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2274#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {2274#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2274#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {2274#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2281#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:24,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {2281#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2281#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:24,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {2281#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2288#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {2288#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2288#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {2288#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2295#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {2295#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2295#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {2295#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2302#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {2302#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2302#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {2302#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2309#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {2309#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2309#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {2309#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2316#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {2316#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2316#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {2316#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2323#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {2323#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2323#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {2323#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {2330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {2330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2337#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:24,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {2337#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {2251#false} is VALID [2018-11-23 11:29:24,208 INFO L256 TraceCheckUtils]: 26: Hoare triple {2251#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2251#false} is VALID [2018-11-23 11:29:24,209 INFO L273 TraceCheckUtils]: 27: Hoare triple {2251#false} ~cond := #in~cond; {2251#false} is VALID [2018-11-23 11:29:24,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {2251#false} assume 0bv32 == ~cond; {2251#false} is VALID [2018-11-23 11:29:24,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {2251#false} assume !false; {2251#false} is VALID [2018-11-23 11:29:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:24,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:25,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {2251#false} assume !false; {2251#false} is VALID [2018-11-23 11:29:25,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {2251#false} assume 0bv32 == ~cond; {2251#false} is VALID [2018-11-23 11:29:25,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {2251#false} ~cond := #in~cond; {2251#false} is VALID [2018-11-23 11:29:25,071 INFO L256 TraceCheckUtils]: 26: Hoare triple {2251#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2251#false} is VALID [2018-11-23 11:29:25,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {2365#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {2251#false} is VALID [2018-11-23 11:29:25,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {2369#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2365#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:25,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {2373#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2369#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:25,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {2377#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2373#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:25,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {2377#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2377#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {2384#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2377#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {2384#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2384#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {2391#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2384#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {2391#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2391#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:25,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {2398#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2391#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:25,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {2398#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2398#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {2405#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2398#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {2405#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2405#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2405#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {2412#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2412#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2412#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {2419#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2419#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:25,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {2426#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2419#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:25,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {2426#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2426#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {2433#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2426#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {2433#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2433#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,136 INFO L273 TraceCheckUtils]: 4: Hoare triple {2250#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2433#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:25,136 INFO L256 TraceCheckUtils]: 3: Hoare triple {2250#true} call #t~ret2 := main(); {2250#true} is VALID [2018-11-23 11:29:25,136 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2250#true} {2250#true} #37#return; {2250#true} is VALID [2018-11-23 11:29:25,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {2250#true} assume true; {2250#true} is VALID [2018-11-23 11:29:25,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {2250#true} call ULTIMATE.init(); {2250#true} is VALID [2018-11-23 11:29:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-23 11:29:25,145 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:29:25,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:25,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:29:25,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:25,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:29:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:29:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:29:25,263 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 25 states. [2018-11-23 11:29:25,760 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:29:26,257 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:29:27,024 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:29:29,079 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:29:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:29,331 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-11-23 11:29:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:29:29,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:29:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:29:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 11:29:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:29:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 11:29:29,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 83 transitions. [2018-11-23 11:29:29,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:29,565 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:29:29,565 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:29:29,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:29:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:29:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 11:29:29,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:29,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2018-11-23 11:29:29,687 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-23 11:29:29,687 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-23 11:29:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:29,691 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:29:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:29:29,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:29,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:29,692 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-23 11:29:29,692 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-23 11:29:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:29,695 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:29:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:29:29,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:29,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:29,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:29,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:29:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-11-23 11:29:29,699 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 30 [2018-11-23 11:29:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:29,699 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-23 11:29:29,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:29:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:29:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:29:29,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:29,700 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:29,701 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:29,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 3 times [2018-11-23 11:29:29,701 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:29,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:29,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:29:29,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:29,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:30,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {2937#true} call ULTIMATE.init(); {2937#true} is VALID [2018-11-23 11:29:30,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {2937#true} assume true; {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2937#true} {2937#true} #37#return; {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {2937#true} call #t~ret2 := main(); {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {2937#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {2937#true} is VALID [2018-11-23 11:29:30,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {2937#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#true} is VALID [2018-11-23 11:29:30,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {2937#true} assume !!~bvult32(~x~0, 99bv32); {3059#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:30,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {3059#(bvult main_~x~0 (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3063#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv99 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:30,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {3063#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv99 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !~bvult32(~x~0, 99bv32); {3067#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv99 32)) (not (bvult main_~x~0 (_ bv99 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:30,097 INFO L256 TraceCheckUtils]: 42: Hoare triple {3067#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv99 32)) (not (bvult main_~x~0 (_ bv99 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3071#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {3071#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3075#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {3075#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2938#false} is VALID [2018-11-23 11:29:30,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2018-11-23 11:29:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-23 11:29:30,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:29:30,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 11:29:30,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:30,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:29:30,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:30,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:29:30,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:29:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:30,212 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 7 states. [2018-11-23 11:29:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,737 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-23 11:29:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:29:30,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 11:29:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:29:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 11:29:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:29:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 11:29:30,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2018-11-23 11:29:30,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:30,807 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:29:30,807 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:29:30,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:29:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:29:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 11:29:30,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:30,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 11:29:30,973 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:29:30,973 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:29:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,975 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 11:29:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 11:29:30,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:30,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:30,976 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:29:30,976 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:29:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,978 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 11:29:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 11:29:30,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:30,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:30,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:30,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:29:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 11:29:30,980 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 46 [2018-11-23 11:29:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 11:29:30,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:29:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 11:29:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 11:29:30,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:30,982 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:30,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:30,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 4 times [2018-11-23 11:29:30,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:31,001 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:29:31,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:29:31,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:31,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:31,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 11:29:31,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 11:29:31,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3423#true} {3423#true} #37#return; {3423#true} is VALID [2018-11-23 11:29:31,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 11:29:31,912 INFO L273 TraceCheckUtils]: 4: Hoare triple {3423#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3440#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:31,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {3440#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3440#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:31,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {3440#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3447#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {3447#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3447#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {3447#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {3454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {3454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3461#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:31,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {3461#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3461#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:31,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {3461#(= (_ bv6 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3468#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {3468#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3468#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {3468#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3475#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {3475#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3475#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {3475#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3482#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {3482#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3482#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {3482#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3489#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {3489#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3489#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {3489#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3496#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {3496#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3496#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {3496#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3503#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {3503#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3503#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {3503#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3510#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {3510#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3510#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {3510#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3517#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {3517#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3517#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {3517#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3524#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {3524#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3524#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {3524#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3531#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,937 INFO L273 TraceCheckUtils]: 31: Hoare triple {3531#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3531#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,938 INFO L273 TraceCheckUtils]: 32: Hoare triple {3531#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3538#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,938 INFO L273 TraceCheckUtils]: 33: Hoare triple {3538#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3538#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,939 INFO L273 TraceCheckUtils]: 34: Hoare triple {3538#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3545#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,940 INFO L273 TraceCheckUtils]: 35: Hoare triple {3545#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3545#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {3545#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3552#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {3552#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3552#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,942 INFO L273 TraceCheckUtils]: 38: Hoare triple {3552#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3559#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {3559#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3559#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {3559#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3566#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {3566#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3566#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,946 INFO L273 TraceCheckUtils]: 42: Hoare triple {3566#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3573#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {3573#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3573#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {3573#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3580#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {3580#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3580#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,949 INFO L273 TraceCheckUtils]: 46: Hoare triple {3580#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3587#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:29:31,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {3587#(= (_ bv42 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3587#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:29:31,950 INFO L273 TraceCheckUtils]: 48: Hoare triple {3587#(= (_ bv42 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3594#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:31,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {3594#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {3424#false} is VALID [2018-11-23 11:29:31,952 INFO L256 TraceCheckUtils]: 50: Hoare triple {3424#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3424#false} is VALID [2018-11-23 11:29:31,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 11:29:31,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume 0bv32 == ~cond; {3424#false} is VALID [2018-11-23 11:29:31,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 11:29:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:31,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:33,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 11:29:33,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume 0bv32 == ~cond; {3424#false} is VALID [2018-11-23 11:29:33,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 11:29:33,864 INFO L256 TraceCheckUtils]: 50: Hoare triple {3424#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3424#false} is VALID [2018-11-23 11:29:33,865 INFO L273 TraceCheckUtils]: 49: Hoare triple {3622#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {3424#false} is VALID [2018-11-23 11:29:33,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {3626#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3622#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:33,867 INFO L273 TraceCheckUtils]: 47: Hoare triple {3626#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3626#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {3633#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3626#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {3633#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3633#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {3640#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3633#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {3640#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3640#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {3647#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3640#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,889 INFO L273 TraceCheckUtils]: 41: Hoare triple {3647#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3647#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {3654#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3647#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {3654#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3654#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {3661#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3654#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {3661#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3661#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {3668#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3661#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {3668#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3668#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {3675#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3668#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {3675#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3675#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3675#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3682#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {3689#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3682#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {3689#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3689#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {3696#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3689#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {3696#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3696#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {3703#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3696#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {3703#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3703#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {3710#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3703#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3710#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {3717#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3710#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {3717#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3717#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {3724#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3717#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {3724#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3724#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {3731#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3724#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {3731#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3731#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {3738#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3731#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {3738#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3738#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {3745#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3738#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {3745#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3745#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {3752#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3745#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {3752#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3752#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {3759#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3752#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {3759#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3759#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {3766#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3759#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {3766#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3766#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {3773#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3766#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {3773#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3773#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {3423#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3773#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:33,992 INFO L256 TraceCheckUtils]: 3: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 11:29:33,992 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3423#true} {3423#true} #37#return; {3423#true} is VALID [2018-11-23 11:29:33,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 11:29:33,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 11:29:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:29:34,001 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-11-23 11:29:34,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:34,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:29:34,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:34,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:29:34,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:29:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:29:34,242 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 48 states. [2018-11-23 11:29:38,003 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:29:38,645 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:29:39,205 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:29:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:48,249 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2018-11-23 11:29:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:29:48,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-11-23 11:29:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:29:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 131 transitions. [2018-11-23 11:29:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:29:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 131 transitions. [2018-11-23 11:29:48,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 131 transitions. [2018-11-23 11:29:48,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:48,541 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:29:48,544 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 11:29:48,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:29:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 11:29:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-23 11:29:48,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:48,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-23 11:29:48,664 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-23 11:29:48,664 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-23 11:29:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:48,666 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-23 11:29:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-23 11:29:48,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:48,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:48,667 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-23 11:29:48,667 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-23 11:29:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:48,669 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-23 11:29:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-23 11:29:48,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:48,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:48,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:48,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 11:29:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-11-23 11:29:48,672 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 54 [2018-11-23 11:29:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:48,672 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-11-23 11:29:48,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:29:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-23 11:29:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 11:29:48,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:48,673 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:48,673 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -99011474, now seen corresponding path program 5 times [2018-11-23 11:29:48,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:48,692 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:29:51,886 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 11:29:51,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:51,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:54,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {4363#true} call ULTIMATE.init(); {4363#true} is VALID [2018-11-23 11:29:54,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:29:54,746 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4363#true} {4363#true} #37#return; {4363#true} is VALID [2018-11-23 11:29:54,747 INFO L256 TraceCheckUtils]: 3: Hoare triple {4363#true} call #t~ret2 := main(); {4363#true} is VALID [2018-11-23 11:29:54,747 INFO L273 TraceCheckUtils]: 4: Hoare triple {4363#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {4380#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:54,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {4380#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4380#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:54,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {4380#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4387#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {4387#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4387#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {4387#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4394#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {4394#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4394#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {4394#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4401#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:54,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {4401#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4401#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:54,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {4401#(= (_ bv6 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4408#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {4408#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4408#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {4408#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4415#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {4415#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4415#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {4415#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4422#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {4422#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4422#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {4422#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4429#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {4429#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4429#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {4429#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4436#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {4436#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4436#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {4436#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4443#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {4443#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4443#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {4443#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4450#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {4450#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4450#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {4450#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4457#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {4457#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4457#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {4457#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4464#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {4464#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4464#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {4464#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4471#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {4471#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4471#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {4471#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4478#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {4478#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4478#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {4478#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4485#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {4485#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4485#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {4485#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4492#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {4492#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4492#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {4492#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4499#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {4499#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4499#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {4499#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4506#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {4506#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4506#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {4506#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4513#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {4513#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4513#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {4513#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4520#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {4520#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4520#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {4520#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4527#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {4527#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4527#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {4527#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4534#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {4534#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4534#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,776 INFO L273 TraceCheckUtils]: 50: Hoare triple {4534#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4541#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {4541#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4541#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,778 INFO L273 TraceCheckUtils]: 52: Hoare triple {4541#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4548#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {4548#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4548#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,779 INFO L273 TraceCheckUtils]: 54: Hoare triple {4548#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4555#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {4555#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4555#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {4555#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4562#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,781 INFO L273 TraceCheckUtils]: 57: Hoare triple {4562#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4562#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {4562#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4569#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:29:54,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {4569#(= (_ bv54 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4569#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:29:54,783 INFO L273 TraceCheckUtils]: 60: Hoare triple {4569#(= (_ bv54 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4576#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,783 INFO L273 TraceCheckUtils]: 61: Hoare triple {4576#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4576#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,784 INFO L273 TraceCheckUtils]: 62: Hoare triple {4576#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4583#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {4583#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4583#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {4583#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4590#(= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {4590#(= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4590#(= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,787 INFO L273 TraceCheckUtils]: 66: Hoare triple {4590#(= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4597#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,787 INFO L273 TraceCheckUtils]: 67: Hoare triple {4597#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4597#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,788 INFO L273 TraceCheckUtils]: 68: Hoare triple {4597#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4604#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,789 INFO L273 TraceCheckUtils]: 69: Hoare triple {4604#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4604#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,789 INFO L273 TraceCheckUtils]: 70: Hoare triple {4604#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4611#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,790 INFO L273 TraceCheckUtils]: 71: Hoare triple {4611#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4611#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,791 INFO L273 TraceCheckUtils]: 72: Hoare triple {4611#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4618#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,791 INFO L273 TraceCheckUtils]: 73: Hoare triple {4618#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4618#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {4618#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4625#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,793 INFO L273 TraceCheckUtils]: 75: Hoare triple {4625#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4625#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,794 INFO L273 TraceCheckUtils]: 76: Hoare triple {4625#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4632#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,794 INFO L273 TraceCheckUtils]: 77: Hoare triple {4632#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4632#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,795 INFO L273 TraceCheckUtils]: 78: Hoare triple {4632#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4639#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {4639#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4639#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {4639#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4646#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {4646#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4646#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,798 INFO L273 TraceCheckUtils]: 82: Hoare triple {4646#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4653#(= (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,798 INFO L273 TraceCheckUtils]: 83: Hoare triple {4653#(= (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4653#(= (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {4653#(= (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4660#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {4660#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4660#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,801 INFO L273 TraceCheckUtils]: 86: Hoare triple {4660#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4667#(= (_ bv82 32) main_~x~0)} is VALID [2018-11-23 11:29:54,801 INFO L273 TraceCheckUtils]: 87: Hoare triple {4667#(= (_ bv82 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4667#(= (_ bv82 32) main_~x~0)} is VALID [2018-11-23 11:29:54,802 INFO L273 TraceCheckUtils]: 88: Hoare triple {4667#(= (_ bv82 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4674#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {4674#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4674#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,803 INFO L273 TraceCheckUtils]: 90: Hoare triple {4674#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4681#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,804 INFO L273 TraceCheckUtils]: 91: Hoare triple {4681#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4681#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,805 INFO L273 TraceCheckUtils]: 92: Hoare triple {4681#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4688#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,805 INFO L273 TraceCheckUtils]: 93: Hoare triple {4688#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4688#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,822 INFO L273 TraceCheckUtils]: 94: Hoare triple {4688#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4695#(= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,823 INFO L273 TraceCheckUtils]: 95: Hoare triple {4695#(= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4695#(= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,823 INFO L273 TraceCheckUtils]: 96: Hoare triple {4695#(= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4702#(= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:54,823 INFO L273 TraceCheckUtils]: 97: Hoare triple {4702#(= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {4364#false} is VALID [2018-11-23 11:29:54,824 INFO L256 TraceCheckUtils]: 98: Hoare triple {4364#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4364#false} is VALID [2018-11-23 11:29:54,824 INFO L273 TraceCheckUtils]: 99: Hoare triple {4364#false} ~cond := #in~cond; {4364#false} is VALID [2018-11-23 11:29:54,824 INFO L273 TraceCheckUtils]: 100: Hoare triple {4364#false} assume 0bv32 == ~cond; {4364#false} is VALID [2018-11-23 11:29:54,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {4364#false} assume !false; {4364#false} is VALID [2018-11-23 11:29:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:54,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:06,832 INFO L273 TraceCheckUtils]: 101: Hoare triple {4364#false} assume !false; {4364#false} is VALID [2018-11-23 11:30:06,832 INFO L273 TraceCheckUtils]: 100: Hoare triple {4364#false} assume 0bv32 == ~cond; {4364#false} is VALID [2018-11-23 11:30:06,832 INFO L273 TraceCheckUtils]: 99: Hoare triple {4364#false} ~cond := #in~cond; {4364#false} is VALID [2018-11-23 11:30:06,832 INFO L256 TraceCheckUtils]: 98: Hoare triple {4364#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4364#false} is VALID [2018-11-23 11:30:06,833 INFO L273 TraceCheckUtils]: 97: Hoare triple {4730#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {4364#false} is VALID [2018-11-23 11:30:06,834 INFO L273 TraceCheckUtils]: 96: Hoare triple {4734#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4730#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:30:06,835 INFO L273 TraceCheckUtils]: 95: Hoare triple {4738#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4734#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:30:06,838 INFO L273 TraceCheckUtils]: 94: Hoare triple {4742#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4738#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,838 INFO L273 TraceCheckUtils]: 93: Hoare triple {4742#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4742#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,844 INFO L273 TraceCheckUtils]: 92: Hoare triple {4749#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4742#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,845 INFO L273 TraceCheckUtils]: 91: Hoare triple {4749#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4749#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,849 INFO L273 TraceCheckUtils]: 90: Hoare triple {4756#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4749#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,849 INFO L273 TraceCheckUtils]: 89: Hoare triple {4756#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4756#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {4763#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4756#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,856 INFO L273 TraceCheckUtils]: 87: Hoare triple {4763#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4763#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,860 INFO L273 TraceCheckUtils]: 86: Hoare triple {4770#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4763#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,860 INFO L273 TraceCheckUtils]: 85: Hoare triple {4770#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4770#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,865 INFO L273 TraceCheckUtils]: 84: Hoare triple {4777#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4770#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,865 INFO L273 TraceCheckUtils]: 83: Hoare triple {4777#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4777#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {4784#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4777#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,871 INFO L273 TraceCheckUtils]: 81: Hoare triple {4784#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4784#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,877 INFO L273 TraceCheckUtils]: 80: Hoare triple {4791#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4784#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,877 INFO L273 TraceCheckUtils]: 79: Hoare triple {4791#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4791#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {4798#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4791#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,882 INFO L273 TraceCheckUtils]: 77: Hoare triple {4798#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4798#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,887 INFO L273 TraceCheckUtils]: 76: Hoare triple {4805#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4798#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,887 INFO L273 TraceCheckUtils]: 75: Hoare triple {4805#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4805#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {4812#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4805#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {4812#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4812#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {4819#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4812#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,896 INFO L273 TraceCheckUtils]: 71: Hoare triple {4819#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4819#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,901 INFO L273 TraceCheckUtils]: 70: Hoare triple {4826#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4819#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {4826#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4826#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,907 INFO L273 TraceCheckUtils]: 68: Hoare triple {4833#(or (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4826#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,908 INFO L273 TraceCheckUtils]: 67: Hoare triple {4833#(or (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4833#(or (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,912 INFO L273 TraceCheckUtils]: 66: Hoare triple {4840#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4833#(or (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {4840#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4840#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {4847#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4840#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {4847#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4847#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,923 INFO L273 TraceCheckUtils]: 62: Hoare triple {4854#(or (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4847#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,924 INFO L273 TraceCheckUtils]: 61: Hoare triple {4854#(or (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4854#(or (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {4861#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4854#(or (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {4861#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4861#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {4868#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4861#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {4868#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4868#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {4875#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4868#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,939 INFO L273 TraceCheckUtils]: 55: Hoare triple {4875#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4875#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,945 INFO L273 TraceCheckUtils]: 54: Hoare triple {4882#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4875#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {4882#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4882#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {4889#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4882#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {4889#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4889#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {4896#(or (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4889#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {4896#(or (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4896#(or (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {4903#(or (not (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4896#(or (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {4903#(or (not (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4903#(or (not (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,969 INFO L273 TraceCheckUtils]: 46: Hoare triple {4910#(or (not (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4903#(or (not (bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {4910#(or (not (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4910#(or (not (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {4917#(or (not (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4910#(or (not (bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,975 INFO L273 TraceCheckUtils]: 43: Hoare triple {4917#(or (not (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4917#(or (not (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,981 INFO L273 TraceCheckUtils]: 42: Hoare triple {4924#(or (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4917#(or (not (bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {4924#(or (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4924#(or (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {4931#(or (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4924#(or (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,987 INFO L273 TraceCheckUtils]: 39: Hoare triple {4931#(or (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4931#(or (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {4938#(or (not (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4931#(or (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:06,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {4938#(or (not (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4938#(or (not (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {4945#(or (not (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4938#(or (not (bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {4945#(or (not (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4945#(or (not (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {4952#(or (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4945#(or (not (bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:06,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {4952#(or (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4952#(or (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {4959#(or (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4952#(or (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv62 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {4959#(or (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4959#(or (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {4966#(or (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4959#(or (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv64 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {4966#(or (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4966#(or (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {4973#(or (not (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4966#(or (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv66 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {4973#(or (not (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {4973#(or (not (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {4980#(or (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4973#(or (not (bvult (bvadd main_~x~0 (_ bv68 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {4980#(or (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4980#(or (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {4987#(or (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4980#(or (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv70 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {4987#(or (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4987#(or (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {4994#(or (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4987#(or (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv72 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {4994#(or (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {4994#(or (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {5001#(or (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {4994#(or (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv74 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {5001#(or (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {5001#(or (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {5008#(or (not (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5001#(or (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv76 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {5008#(or (not (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {5008#(or (not (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {5015#(or (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5008#(or (not (bvult (bvadd main_~x~0 (_ bv78 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {5015#(or (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {5015#(or (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {5022#(or (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5015#(or (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv80 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {5022#(or (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {5022#(or (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {5029#(or (not (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5022#(or (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv82 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {5029#(or (not (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {5029#(or (not (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {5036#(or (not (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5029#(or (not (bvult (bvadd main_~x~0 (_ bv84 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {5036#(or (not (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {5036#(or (not (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {5043#(or (not (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5036#(or (not (bvult (bvadd main_~x~0 (_ bv86 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {5043#(or (not (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {5043#(or (not (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {5050#(or (bvult (bvadd main_~x~0 (_ bv92 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {5043#(or (not (bvult (bvadd main_~x~0 (_ bv88 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32)))} is VALID [2018-11-23 11:30:07,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {5050#(or (bvult (bvadd main_~x~0 (_ bv92 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {5050#(or (bvult (bvadd main_~x~0 (_ bv92 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {4363#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {5050#(or (bvult (bvadd main_~x~0 (_ bv92 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv90 32)) (_ bv99 32))))} is VALID [2018-11-23 11:30:07,086 INFO L256 TraceCheckUtils]: 3: Hoare triple {4363#true} call #t~ret2 := main(); {4363#true} is VALID [2018-11-23 11:30:07,086 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4363#true} {4363#true} #37#return; {4363#true} is VALID [2018-11-23 11:30:07,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {4363#true} assume true; {4363#true} is VALID [2018-11-23 11:30:07,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {4363#true} call ULTIMATE.init(); {4363#true} is VALID [2018-11-23 11:30:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:07,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:07,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 97 [2018-11-23 11:30:07,116 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 102 [2018-11-23 11:30:07,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:07,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states. [2018-11-23 11:30:07,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:07,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-23 11:30:07,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-23 11:30:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2405, Invalid=6907, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:30:07,678 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 97 states. [2018-11-23 11:30:22,745 WARN L180 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 230 DAG size of output: 225 [2018-11-23 11:30:27,589 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 225 [2018-11-23 11:30:32,557 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification that was a NOOP. DAG size: 222 [2018-11-23 11:30:38,538 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 219 [2018-11-23 11:30:48,847 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 234 [2018-11-23 11:30:52,230 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 217 DAG size of output: 7 [2018-11-23 11:30:57,781 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 212 DAG size of output: 7 [2018-11-23 11:31:01,444 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 207 DAG size of output: 7 [2018-11-23 11:31:04,882 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 202 DAG size of output: 7 [2018-11-23 11:31:08,036 WARN L180 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 7 [2018-11-23 11:31:11,210 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 192 DAG size of output: 7 [2018-11-23 11:31:14,334 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 7 [2018-11-23 11:31:17,530 WARN L180 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 7 [2018-11-23 11:31:20,542 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 7 [2018-11-23 11:31:23,437 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 7 [2018-11-23 11:31:26,443 WARN L180 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 7 [2018-11-23 11:31:29,387 WARN L180 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 7 [2018-11-23 11:31:32,267 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 7 [2018-11-23 11:31:35,091 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 7 [2018-11-23 11:31:37,868 WARN L180 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 7 [2018-11-23 11:31:40,605 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 11:31:43,180 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 7 [2018-11-23 11:31:45,906 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 7 [2018-11-23 11:31:48,414 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 11:31:50,718 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 7 [2018-11-23 11:31:52,881 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 7 [2018-11-23 11:31:55,014 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 11:31:57,118 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 7 [2018-11-23 11:31:59,410 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 7 [2018-11-23 11:32:01,440 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 11:32:03,316 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 7 [2018-11-23 11:32:04,992 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 7 [2018-11-23 11:32:06,709 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 11:32:08,319 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 7 [2018-11-23 11:32:09,833 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 7 [2018-11-23 11:32:11,338 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:32:12,663 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 7 [2018-11-23 11:32:13,978 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 7 [2018-11-23 11:32:15,224 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:32:16,530 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:32:17,654 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-23 11:32:18,710 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:32:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:22,683 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2018-11-23 11:32:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-23 11:32:22,683 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 102 [2018-11-23 11:32:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 11:32:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 251 transitions. [2018-11-23 11:32:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 11:32:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 251 transitions. [2018-11-23 11:32:22,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 251 transitions. [2018-11-23 11:32:23,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:23,857 INFO L225 Difference]: With dead ends: 204 [2018-11-23 11:32:23,857 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 11:32:23,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 63 SyntacticMatches, 45 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2538 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=5894, Invalid=14986, Unknown=0, NotChecked=0, Total=20880 [2018-11-23 11:32:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 11:32:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-23 11:32:24,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:24,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 199 states. [2018-11-23 11:32:24,657 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-23 11:32:24,658 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-23 11:32:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:24,663 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-11-23 11:32:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-23 11:32:24,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:24,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:24,664 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-23 11:32:24,664 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-23 11:32:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:24,669 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-11-23 11:32:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-23 11:32:24,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:24,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:24,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:24,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 11:32:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-23 11:32:24,675 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 102 [2018-11-23 11:32:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-23 11:32:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-23 11:32:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-23 11:32:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 11:32:24,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:24,677 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:24,677 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:24,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1804250654, now seen corresponding path program 6 times [2018-11-23 11:32:24,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:24,722 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:32:27,972 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-11-23 11:32:27,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:28,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:30,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {6172#true} call ULTIMATE.init(); {6172#true} is VALID [2018-11-23 11:32:30,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {6172#true} assume true; {6172#true} is VALID [2018-11-23 11:32:30,879 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6172#true} {6172#true} #37#return; {6172#true} is VALID [2018-11-23 11:32:30,879 INFO L256 TraceCheckUtils]: 3: Hoare triple {6172#true} call #t~ret2 := main(); {6172#true} is VALID [2018-11-23 11:32:30,880 INFO L273 TraceCheckUtils]: 4: Hoare triple {6172#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {6189#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:32:30,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {6189#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6189#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:32:30,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {6189#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6196#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {6196#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6196#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {6196#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6203#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:32:30,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {6203#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6203#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:32:30,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {6203#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6210#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {6210#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6210#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {6210#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6217#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6217#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {6217#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6224#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {6224#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6224#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {6224#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6231#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {6231#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6231#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {6231#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6238#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:32:30,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {6238#(= (_ bv14 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6238#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:32:30,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {6238#(= (_ bv14 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6245#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {6245#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6245#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {6245#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6252#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {6252#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6252#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {6252#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6259#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {6259#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6259#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {6259#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6266#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,892 INFO L273 TraceCheckUtils]: 27: Hoare triple {6266#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6266#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {6266#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6273#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {6273#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6273#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {6273#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6280#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {6280#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6280#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {6280#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6287#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {6287#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6287#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {6287#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6294#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {6294#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6294#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {6294#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6301#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {6301#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6301#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {6301#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6308#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {6308#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6308#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {6308#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6315#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {6315#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6315#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {6315#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6322#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,932 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6322#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,933 INFO L273 TraceCheckUtils]: 44: Hoare triple {6322#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6329#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,933 INFO L273 TraceCheckUtils]: 45: Hoare triple {6329#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6329#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {6329#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6336#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:32:30,934 INFO L273 TraceCheckUtils]: 47: Hoare triple {6336#(= (_ bv42 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6336#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:32:30,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {6336#(= (_ bv42 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6343#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {6343#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6343#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {6343#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6350#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,936 INFO L273 TraceCheckUtils]: 51: Hoare triple {6350#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6350#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {6350#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6357#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,937 INFO L273 TraceCheckUtils]: 53: Hoare triple {6357#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6357#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {6357#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6364#(and (= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,939 INFO L273 TraceCheckUtils]: 55: Hoare triple {6364#(and (= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6364#(and (= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,940 INFO L273 TraceCheckUtils]: 56: Hoare triple {6364#(and (= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6371#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,940 INFO L273 TraceCheckUtils]: 57: Hoare triple {6371#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6371#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,941 INFO L273 TraceCheckUtils]: 58: Hoare triple {6371#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6378#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv54 32) main_~x~0))} is VALID [2018-11-23 11:32:30,942 INFO L273 TraceCheckUtils]: 59: Hoare triple {6378#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv54 32) main_~x~0))} assume !!~bvult32(~x~0, 99bv32); {6378#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv54 32) main_~x~0))} is VALID [2018-11-23 11:32:30,943 INFO L273 TraceCheckUtils]: 60: Hoare triple {6378#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv54 32) main_~x~0))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6385#(and (= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {6385#(and (= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6385#(and (= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,944 INFO L273 TraceCheckUtils]: 62: Hoare triple {6385#(and (= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6392#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,945 INFO L273 TraceCheckUtils]: 63: Hoare triple {6392#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6392#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,946 INFO L273 TraceCheckUtils]: 64: Hoare triple {6392#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6399#(and (= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,947 INFO L273 TraceCheckUtils]: 65: Hoare triple {6399#(and (= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6399#(and (= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,947 INFO L273 TraceCheckUtils]: 66: Hoare triple {6399#(and (= (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6406#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,948 INFO L273 TraceCheckUtils]: 67: Hoare triple {6406#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6406#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,949 INFO L273 TraceCheckUtils]: 68: Hoare triple {6406#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6413#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,950 INFO L273 TraceCheckUtils]: 69: Hoare triple {6413#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6413#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,951 INFO L273 TraceCheckUtils]: 70: Hoare triple {6413#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6420#(and (= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,952 INFO L273 TraceCheckUtils]: 71: Hoare triple {6420#(and (= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6420#(and (= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,952 INFO L273 TraceCheckUtils]: 72: Hoare triple {6420#(and (= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6427#(and (= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,953 INFO L273 TraceCheckUtils]: 73: Hoare triple {6427#(and (= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6427#(and (= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {6427#(and (= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6434#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,955 INFO L273 TraceCheckUtils]: 75: Hoare triple {6434#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6434#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,956 INFO L273 TraceCheckUtils]: 76: Hoare triple {6434#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6441#(and (= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,956 INFO L273 TraceCheckUtils]: 77: Hoare triple {6441#(and (= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6441#(and (= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,957 INFO L273 TraceCheckUtils]: 78: Hoare triple {6441#(and (= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6448#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,958 INFO L273 TraceCheckUtils]: 79: Hoare triple {6448#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6448#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {6448#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6455#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,959 INFO L273 TraceCheckUtils]: 81: Hoare triple {6455#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6455#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,960 INFO L273 TraceCheckUtils]: 82: Hoare triple {6455#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6462#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv78 32) main_~x~0))} is VALID [2018-11-23 11:32:30,961 INFO L273 TraceCheckUtils]: 83: Hoare triple {6462#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv78 32) main_~x~0))} assume !!~bvult32(~x~0, 99bv32); {6462#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv78 32) main_~x~0))} is VALID [2018-11-23 11:32:30,961 INFO L273 TraceCheckUtils]: 84: Hoare triple {6462#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv78 32) main_~x~0))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6469#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {6469#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6469#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,963 INFO L273 TraceCheckUtils]: 86: Hoare triple {6469#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6476#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv82 32) main_~x~0))} is VALID [2018-11-23 11:32:30,964 INFO L273 TraceCheckUtils]: 87: Hoare triple {6476#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv82 32) main_~x~0))} assume !!~bvult32(~x~0, 99bv32); {6476#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv82 32) main_~x~0))} is VALID [2018-11-23 11:32:30,964 INFO L273 TraceCheckUtils]: 88: Hoare triple {6476#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (_ bv82 32) main_~x~0))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6483#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {6483#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6483#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,966 INFO L273 TraceCheckUtils]: 90: Hoare triple {6483#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6490#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,967 INFO L273 TraceCheckUtils]: 91: Hoare triple {6490#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6490#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,968 INFO L273 TraceCheckUtils]: 92: Hoare triple {6490#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6497#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,968 INFO L273 TraceCheckUtils]: 93: Hoare triple {6497#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6497#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,969 INFO L273 TraceCheckUtils]: 94: Hoare triple {6497#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6504#(and (= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,970 INFO L273 TraceCheckUtils]: 95: Hoare triple {6504#(and (= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6504#(and (= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,971 INFO L273 TraceCheckUtils]: 96: Hoare triple {6504#(and (= (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6511#(and (= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {6511#(and (= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6511#(and (= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,972 INFO L273 TraceCheckUtils]: 98: Hoare triple {6511#(and (= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32)) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6518#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967202 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {6518#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967202 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6518#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967202 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,974 INFO L273 TraceCheckUtils]: 100: Hoare triple {6518#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967202 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6525#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,975 INFO L273 TraceCheckUtils]: 101: Hoare triple {6525#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6525#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,975 INFO L273 TraceCheckUtils]: 102: Hoare triple {6525#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6532#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,976 INFO L273 TraceCheckUtils]: 103: Hoare triple {6532#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {6532#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,977 INFO L273 TraceCheckUtils]: 104: Hoare triple {6532#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6539#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,978 INFO L273 TraceCheckUtils]: 105: Hoare triple {6539#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32)))} assume !~bvult32(~x~0, 99bv32); {6539#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:30,979 INFO L256 TraceCheckUtils]: 106: Hoare triple {6539#(and (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6546#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {6546#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {6550#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:30,980 INFO L273 TraceCheckUtils]: 108: Hoare triple {6550#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {6173#false} is VALID [2018-11-23 11:32:30,980 INFO L273 TraceCheckUtils]: 109: Hoare triple {6173#false} assume !false; {6173#false} is VALID [2018-11-23 11:32:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:31,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:35,808 INFO L273 TraceCheckUtils]: 109: Hoare triple {6173#false} assume !false; {6173#false} is VALID [2018-11-23 11:32:35,811 INFO L273 TraceCheckUtils]: 108: Hoare triple {6560#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {6173#false} is VALID [2018-11-23 11:32:35,811 INFO L273 TraceCheckUtils]: 107: Hoare triple {6564#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {6560#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:35,812 INFO L256 TraceCheckUtils]: 106: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6564#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:35,813 INFO L273 TraceCheckUtils]: 105: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,814 INFO L273 TraceCheckUtils]: 104: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,815 INFO L273 TraceCheckUtils]: 103: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,816 INFO L273 TraceCheckUtils]: 102: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,818 INFO L273 TraceCheckUtils]: 101: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,819 INFO L273 TraceCheckUtils]: 100: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,820 INFO L273 TraceCheckUtils]: 99: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,821 INFO L273 TraceCheckUtils]: 98: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,826 INFO L273 TraceCheckUtils]: 97: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,827 INFO L273 TraceCheckUtils]: 96: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,828 INFO L273 TraceCheckUtils]: 95: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,829 INFO L273 TraceCheckUtils]: 94: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,830 INFO L273 TraceCheckUtils]: 93: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,831 INFO L273 TraceCheckUtils]: 92: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,836 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,838 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,838 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,841 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,841 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,843 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,843 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,849 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,849 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,851 INFO L273 TraceCheckUtils]: 76: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,852 INFO L273 TraceCheckUtils]: 75: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,852 INFO L273 TraceCheckUtils]: 74: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,853 INFO L273 TraceCheckUtils]: 73: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,854 INFO L273 TraceCheckUtils]: 72: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,854 INFO L273 TraceCheckUtils]: 71: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,855 INFO L273 TraceCheckUtils]: 70: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,856 INFO L273 TraceCheckUtils]: 69: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,857 INFO L273 TraceCheckUtils]: 68: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,858 INFO L273 TraceCheckUtils]: 67: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,860 INFO L273 TraceCheckUtils]: 65: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,901 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,916 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,932 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,933 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,934 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,952 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, 99bv32); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,970 INFO L273 TraceCheckUtils]: 54: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6568#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:35,971 INFO L273 TraceCheckUtils]: 53: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,978 INFO L273 TraceCheckUtils]: 50: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,997 INFO L273 TraceCheckUtils]: 33: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:35,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} assume !!~bvult32(~x~0, 99bv32); {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,033 INFO L273 TraceCheckUtils]: 4: Hoare triple {6172#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {6725#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:32:36,033 INFO L256 TraceCheckUtils]: 3: Hoare triple {6172#true} call #t~ret2 := main(); {6172#true} is VALID [2018-11-23 11:32:36,033 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6172#true} {6172#true} #37#return; {6172#true} is VALID [2018-11-23 11:32:36,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {6172#true} assume true; {6172#true} is VALID [2018-11-23 11:32:36,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {6172#true} call ULTIMATE.init(); {6172#true} is VALID [2018-11-23 11:32:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-11-23 11:32:36,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:36,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 6] total 59 [2018-11-23 11:32:36,077 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 110 [2018-11-23 11:32:36,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:36,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 11:32:36,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:36,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 11:32:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 11:32:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3228, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:32:36,441 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 59 states.